Abstract

Wireless Sensor Networks (WSN) are divided into two categories as single-hop and multi-hop according to the connection states of the sensor nodes. In the single-hop WSNs, the sensor nodes communicate directly with the management unit (coordinator node). On the other hand, in multi-hop WSNs, the sensor nodes, which are out of the coverage area of the coordinator node communicate with the coordinator over other joined sensor nodes. Multi-hop WSNs preferred for complex applications where there are many sensor nodes. In such applications, connecting to the network and maintaining the continuity in the network is difficult and requires very complicated algorithms for sensor nodes. In this study, a new network-joining algorithm for multi-hop WSNs has been proposed and designed. According to the algorithm, there is a management unit which is named as coordinator node (CN) for maintaining the network connectivity and the nodes which are the members of the network sends network joining requests over a common contention-based channel for joining the network. If there is a coordinator node in the coverage area, the sensor node joins directly to the network and coordinator allocates an appropriate channel to the new node. If the channel has multiple users, it is used as time-shared. If the sensor node is out of coverage area, directly joining to the network is impossible. In this case, the sensor node sends a relay request to the other joined sensor nodes. The available sensor node responds to this relay request via handshake. The sensor node uses the relay node’s channels as shared by using time-sharing methods. Therefore, the new node joins the network from the relay node’s channel. The main goal of this algorithm is to speed up joining of sensor nodes to the networks in multi-hop WSNs. Also, another goal is maximizing the continuity of the sensor nodes in the network. Thus, the algorithm improves performance and ensures data transfer continuity of WSNs.

Highlights

  • Wireless Sensor Networks (WSNs) consists of Sensor Nodes (SNs) connected wirelessly with each other

  • It is obvious that increasing the number of sensor nodes in the network makes more complicated the network

  • Multi-hop WSNs have advantages such as coverage, high data transmission rate, low cost[6]. Thanks to these networks, which spread over large areas, data can be collected by consuming less energy

Read more

Summary

INTRODUCTION

Wireless Sensor Networks (WSNs) consists of Sensor Nodes (SNs) connected wirelessly with each other. Complex structured WSNs use a multi-hop network structure as a connection method In such networks, as shown, the sensor nodes extend coverage of the network by communicating with each other [4], [5]. Difficulties which foreseen in the multi-hop WSN design are negative factors such as congestion[1], end-to-end delay, hidden node, simultaneous communication, a disconnection of nodes from the network, topology changes[4], and fairness[6]. These difficulties have a negative impact on the performance of the network. The performance of this algorithm has been tested based on node counts at random form of nodes in the Riverbed Modeler simulation environment

A NEW JOINING ALGORITHM FOR MULTI-HOP NON-MOBILE WIRELESS SENSOR NETWORKS
CONCLUSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call