• Title/Summary/Keyword: redundant route nodes

Search Result 6, Processing Time 0.015 seconds

Minimizing Redundant Route Nodes in USN by Integrating Spatially Weighted Parameters: Case Study for University Campus (가중치가 부여된 공간변수에 의거하여 USN 루트노드 최소화 방안 -대학 캠퍼스를 사례로-)

  • Kim, Jin-Taek;Um, Jung-Sup
    • Journal of the Korean Geographical Society
    • /
    • v.45 no.6
    • /
    • pp.788-805
    • /
    • 2010
  • The present USN (Ubiquitous Sensor Networks) node deployment practices have many limitations in terms of positional connectivity. The aim of this research was to minimize a redundancy of USN route nodes, by integrating spatially weighted parameters such as visibility, proximity to cell center, road density, building density and cell overlapping ratio into a comprehensive GIS database. This spatially weighted approach made it possible to reduce the number of route nodes (11) required in the study site as compared to that of the grid network method (24). The field test for RSSI (Received Signal Strength Indicator) indicates that the spatially weighted deployment could comply with the quality assurance standard for node connectivity, and that reduced route nodes do not show a significant degree of signal fluctuation for different site conditions. This study demonstrated that the spatially weighted deployment can be used to minimize a redundancy of USN route nodes in a routine manner, and the quantitative evidence removing a redundancy of USN route nodes could be utilized as major tools to ensure the strong signal in the USN, that is frequently encountered in real applications.

Broadcast Redundancy Reduction Algorithm for Enhanced Wireless Sensor Network Lifetime (무선 센서 네트워크의 수명 향상을 위한 브로드캐스트 중복 제거 알고리즘)

  • Park, Cheol-Min;Kim, Young-Chan
    • Journal of Internet Computing and Services
    • /
    • v.8 no.4
    • /
    • pp.71-79
    • /
    • 2007
  • The communicative behaviors in Wireless Sensor Networks(WSNs) can be characterized by two different types: routing and broadcasting. The broadcasting is used for effective route discoveries and packet delivery. However, broadcasting shorten the network lifetime due to the energy overconsumption by redundant transmissions. In this paper, we proposed a algorithm that remove redundant forward nodes based on Dominant Pruning method using 2-hop neighbors knowledge. Simulation results show that the proposed algorithm appears superior performance in respect of the number of forward nodes and the network lifetime.

  • PDF

A Node Status Control Algorithm in Mobile Ad-Hoc Networks (MANET 환경에서 노드 상태 제어 알고리즘)

  • Lee, Su-Jin;Choi, Dae-In
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.3
    • /
    • pp.188-190
    • /
    • 2014
  • In mobile ad hoc networks(MANETs), each node rebroadcast received route request packets for route discovery. Flooding from large number of nodes induces the broadcast storm problem which causes severe degradation in network performance due to redundant retransmission, collision and contention. This paper presents a node status algorithm based on probabilistic scheme to alleviate the broadcast storm problem for wireless ad hoc networks.

A Probabilistic Broadcasting Mechanism based on Cross Layer Model Deliberating Received Signal Strength Ratio in Mobile Ad Hoc Networks

  • Kim, Jae-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.3
    • /
    • pp.25-32
    • /
    • 2016
  • Mobile Ad Hoc Networks(MANETs) consists of mobile nodes which communicate with each other without any centralized infrastructure. Message broadcasting by flooding for route discovery in MANET can result in high redundant retransmission, contention and collision of broadcasting packet, known as the broadcast storm problem collectively. The cross-layer design is adopted in this paper, which lets routing layer share the received signal strength information at MAC layer. Also this paper proposes a new probabilistic approach that dynamically adjusts the rebroadcasting probability of a node for routing request packets (RREQs) according to the received signal strength. The simulation results show that the proposed approach demonstrates better performance than blind flooding, fixed probabilistic broadcasting approaches.

A Pre-Resource Reservation Mechanism using NSIS protocol (NSIS 프로토콜을 이용한 사전자원예약 방안)

  • Kim, Sun-Young;Byun, Hae-Sun;Lee, Mee-Jeong
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.6
    • /
    • pp.538-548
    • /
    • 2008
  • In the Internet Engineering Task Force(IETF), Next Step in Signaling(NSIS) working group, proposed a mechanism to discover the Crossover Node(CRN), when the route is changed by Mobile Node(MN) handover. The CRN is divergence or convergence node on old and new path for reserving resources. Trough the CRN discovery mechanism, it possible to reduce a signaling delay and avoid the redundant reservation on the common path between old and new path. However, the QoS(Quality of Service) can be guaranteed continuously while the MN is performing handover, it is needed to pre-reserve the resource on the new path before completion of the handover. When the nodes on the new path try to make a pre-resource reservation before the handover, it is difficult to pre-reserve the resource with the existing CRN discovery mechanism. Therefore, we proposed a Passive CRN(PCRN) discovery scheme and pre-resource reservation mechanism. The PCRN which means an initial common point between the current reserved and the new paths, where the handover can take place.

An Efficient Flooding Scheme using Clusters in Mobile Ad-Hoc Networks (애드 혹 네트워크에서 클러스터를 이용한 효율적인 플러딩 방안)

  • Wang Gi-cheol;Kim Tae-yeon;Cho Gi-hwan
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.6
    • /
    • pp.696-704
    • /
    • 2005
  • Flooding is usually utilized to find a multi hop route toward the destination which is not within transmission range in Ad Hoc networks. However, existing flooding schemes deteriorate the network performance because of periodic message exchanges, frequent occurrence of collisions, and redundant packet transmission. To resolve this, a flooding scheme using on demand cluster formation is proposed in this paper. The scheme employs ongoing Packets for constructing a cluster architecture as the existing on demand clustering scheme. Unlike to the existing on demand clustering scheme, the scheme makes use of unicast packet transmission to reduce the number of collisions and to find the flooding candidates easily. As a result, the proposed scheme yields fewer flooding nodes than other schemes. Simulation results proved that the proposed scheme reduces the number of transmissions and collisions than those of two other schemes.