Distributed Multicast Tree Construction in Wireless Sensor Networks

2017 ◽  
Vol 63 (1) ◽  
pp. 280-296 ◽  
Author(s):  
Hongyu Gong ◽  
Luoyi Fu ◽  
Xinzhe Fu ◽  
Lutian Zhao ◽  
Kainan Wang ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Multicast Tree ◽  
Wireless Sensor ◽  
Tree Construction ◽  
Multicast Tree Construction

A Cluster-Based Routing Tree Construction Algorithm for Wireless Sensor Networks

2011 ◽  
Vol 58-60 ◽  
pp. 2245-2250
Author(s):  
Peng Li ◽  
Yan Jun
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Network Routing ◽  
Wireless Sensor ◽  
Construction Algorithm ◽  
Tree Construction ◽  
Routing Technology ◽  
Cluster Based Routing ◽  
Routing Tree

In the architecture of wireless sensor network, routing technology at the network layer is essential. Since the clustering routing leads in good performance on data aggregation, energy minimization and so on, it has become the focus of the study routing. In this paper, a cluster-based routing tree construction algorithm for Wireless Sensor Networks is proposed. The detail of how to select the intermediate nodes to build the routing gathering tree is also described. The experiments show that the algorithm is effective to extend the network lifetime.

Improving broadcast reliability for neighbor discovery, link estimation and collection tree construction in wireless sensor networks

2014 ◽  
Vol 62 ◽  
pp. 101-121 ◽  
Author(s):  
Behnam Dezfouli ◽  
Marjan Radi ◽  
Shukor Abd Razak ◽  
Kamin Whitehouse ◽  
Kamalrulnizam Abu Bakar ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Neighbor Discovery ◽  
Tree Construction

scholarly journals A Hierarchical QoS Routing Protocol for the Wireless Sensor Networks

2013 ◽  
Vol 347-350 ◽  
pp. 2018-2022
Author(s):  
Ze Sshun Zhou ◽  
Yi Xu ◽  
Min Qin ◽  
Chu Yang Mao ◽  
La Yuan Li
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Complexity Analysis ◽  
Minimum Energy ◽  
Qos Routing ◽  
Multicast Tree ◽  
Wireless Sensor ◽  
Minimum Energy Consumption ◽  
Message Overhead

The large wireless sensor networks are often structured hierarchically by grouping nodes into different domains in order to deal with the scaling problem. This paper proposes a new protocol called hierarchical QoS routing protocol (HQRP) that achieves scalability by organizing the network as a hierarchy of domains using the full-mesh aggregation technique. In HQRP, each local node just only needs to maintain local routing and summary information of other domains, but does not requires any global states maintained. The HQRP uses a Reverse Best Metric Path Forwarding approach with hierarchical, topological and QoS forwarding conditions to construct the multicast tree while minimizing message overhead and satisfying delay-bandwidth and minimum energy consumption. The paper presents proof of correctness and complexity analysis of the HQRP. Simulation results show very good performance in terms of success ratio and message overhead.

Secure Coverage Tree Construction Scheme for Wireless Sensor Networks

2014 ◽  
Vol 82 (1) ◽  
pp. 659-674 ◽  
Author(s):  
Irfana Memon ◽  
Pardeep Kumar ◽  
Nisar A. Memon ◽  
Bhawani S. Chowdhry
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Construction Scheme ◽  
Tree Construction
Sign in / Sign up

Export Citation Format

Share Document