The room shortage problem of tree-based ZigBee/IEEE 802.15.4 wireless networks

Yen, Li-Hsing; Tsai, Wei-Ting

doi:10.1016/j.comcom.2009.10.013

Cited by 30 publications

(19 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(2) In this scheme, after the addressing process is complete, a PAN tree is constructed and the routes in a PAN tree are also established without any extra operations. In [15], after the addressing process is complete, a route update process must be performed to establish a route from a ZC to a specific node.…”

Section: Ipv6 Internetmentioning

confidence: 99%

See 1 more Smart Citation

A cross-layer mobility support protocol for wireless sensor networks

Wang

Sun

Yang

2015

Computers & Electrical Engineering

View full text Add to dashboard Cite

Section: Ipv6 Internetmentioning

confidence: 99%

“…The addressing algorithm in [15] is performed in the centralized way and a node acquires an address from a ZigBee coordinator (ZC) which is multi-hop away. (2) In this scheme, after the addressing process is complete, a PAN tree is constructed and the routes in a PAN tree are also established without any extra operations.…”

Section: Ipv6 Internetmentioning

confidence: 99%

A cross-layer mobility support protocol for wireless sensor networks

Wang

Sun

Yang

2015

Computers & Electrical Engineering

View full text Add to dashboard Cite

“…It allows each router to have a unique addressing space based on a hierarchical tree and to use it for the addressing of its child nodes, providing each node a unique address in a distributed manner. However, it may require addressing space increasing exponentially proportional to the network depth [8,9]. Moreover, the parent/child selection algorithm may significantly waste the network depth and also make the node connection proceed to a certain direction, yielding a networking bias problem [10,11].…”

Section: Introductionmentioning

confidence: 99%

Distributed Scalable Network Association in Wireless Sensor Networks

Kim

Han

Bang

et al. 2012

2012 IEEE International Conference on Green Computing and Communications

View full text Add to dashboard Cite

Wireless sensor networks (WSNs) need to employ a network association mechanism that can securely allocate a unique address to each node while minimizing energy consumption. However, conventional centralized and broadcasting based network association mechanisms may consume large energy, and distributed network association mechanisms may suffer from addressing failure when applied to large scale WSNs. In this paper, we consider distributed network association with scalability for the construction of a large scale WSN. The proposed mechanism constructs a large scale addressing tree before network initialization. Based on the addressing tree, it allows each router to have its own addressing space which will be used for unique addressing of its child nodes. Then, a novel parent/child selection algorithm can assign routers to be located throughout the whole deployment area. Thus, nodes can join the network in the presence of sufficient neighbor routers and receive a unique address in a distributed manner. Finally, the performance of the proposed scheme is evaluated by computer simulation, showing remarkable performance improvement over conventional schemes when applied to a large scale WSN.

show abstract

“…The conventional route reconstruction method designed to address this issue consumed a large amount of resources [23,24]. In this study, the seamless mobile access mechanism (SMAM) was studied, which uses the "join-before-exit" mechanism to guarantee the seamless switch when the HMNs move from one RN/CN to another RN/CN.…”

Section: Seamless Mobile Access Mechanism (Smam) For Hmnsmentioning

confidence: 99%

“…The CN has the fixed address 0x0000, and the broadcast address is fixed as 0xFFFF. For the other nodes in the network, the stochastic addressing mechanism is used, which can effectively avoid the room waste problem caused by the Distributed Address Assignment Mechanism (DAAM) [22,23]. Each node maintains an up-to-date twodimensional table (Association Table (AT)), which contains the network information such as network address, relationship, and LQI, RSSI for all the nodes.…”

Section: Lhrpmentioning

confidence: 99%

Implementation and Real-Time and Reliability Evaluation of a WHMS Improved by LHRP and SMAM

Sun

Fang

Zhao

et al. 2015

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

A dynamic heterogeneous and multihop (DHMH) wireless health monitoring system (WHMS) as a three-tier semi-self-organizing health monitoring network was presented. From bottom to top, the first tire of the network is the mobile data acquisition layer (DAL), the second tire of the network is the data transporting layer (DTL), and the third tire of the network is the data collection layer (DCL). A RF power control based topology management mechanism is proposed to balance the network load and to improve the network throughput. A lightweight hierarchical routing protocol (LHRP) was designed to reduce the transmission delay and improve the network throughput. For the mobile DAL nodes, the seamless mobile access mechanism (SMAM) was designed to ensure the low packet loss ratio. To evaluate the network performance, the end-to-end delay, the averaged reception ratio, and the network throughput of the DHMH were tested and the results proved that the network performance of the DHMH was improved.

show abstract

The room shortage problem of tree-based ZigBee/IEEE 802.15.4 wireless networks

Cited by 30 publications

References 7 publications

A cross-layer mobility support protocol for wireless sensor networks

A cross-layer mobility support protocol for wireless sensor networks

Distributed Scalable Network Association in Wireless Sensor Networks

Implementation and Real-Time and Reliability Evaluation of a WHMS Improved by LHRP and SMAM

Contact Info

Product

Resources

About