Extensive research happening across the globe witnessed the importance of Wireless Sensor Network in the present day application world. In the recent past, various routing algorithms have been proposed to elevate WSN network lifetime. Clustering mechanism is highly successful in conserving energy resources for network activities and has become promising field for researches. However, the problem of unbalanced energy consumption is still open because the cluster head activities are tightly coupled with role and location of a particular node in the network. Several unequal clustering algorithms are proposed to solve this wireless sensor network multihop hot spot problem. Current unequal clustering mechanisms consider only intra- and intercluster communication cost. Proper organization of wireless sensor network into clusters enables efficient utilization of limited resources and enhances lifetime of deployed sensor nodes. This paper considers a novel network organization scheme, energy-efficient edge-based network partitioning scheme, to organize sensor nodes into clusters of equal size. Also, it proposes a cluster-based routing algorithm, called zone-based routing protocol (ZBRP), for elevating sensor network lifetime. Experimental results show that ZBRP out-performs interims of network lifetime and energy conservation with its uniform energy consumption among the cluster heads.

/pdf/zone-based-routing-protocol-for-wireless-sensor-networks-12602b27r8.pdf

Zone-Based Routing Protocol for Wireless Sensor Networks

The problem of moving target tracking in directional sensor networks (DSNs) introduces new research challenges, including optimal selection of sensing and communication sectors of the directional sensor nodes, determination of the precise location of the target and an energy-efficient data collection mechanism. Existing solutions allow individual sensor nodes to detect the target's location through collaboration among neighboring nodes, where most of the sensors are activated and communicate with the sink. Therefore, they incur much overhead, loss of energy and reduced target tracking accuracy. In this paper, we have proposed a clustering algorithm, where distributed cluster heads coordinate their member nodes in optimizing the active sensing and communication directions of the nodes, precisely determining the target location by aggregating reported sensing data from multiple nodes and transferring the resultant location information to the sink. Thus, the proposed target tracking mechanism minimizes the sensing redundancy and maximizes the number of sleeping nodes in the network. We have also investigated the dynamic approach of activating sleeping nodes on-demand so that the moving target tracking accuracy can be enhanced while maximizing the network lifetime. We have carried out our extensive simulations in ns-3, and the results show that the proposed mechanism achieves higher performance compared to the state-of-the-art works.

https://www.mdpi.com/1424-8220/14/12/24381/pdf

Moving target tracking through distributed clustering in directional sensor networks.

The easy use of Wireless Sensor Networks has attracted applications from various fields. Day to day rise in wireless sensor network applications introduce new challenges to researchers. One such critical challenge is, optimal usage of network resources. Energy is one of the most important concerns in wireless sensor networks. Even though there has been an extensive research work done on this issue, the problem is still open with new requirements emerging every day. Exchange of control information consumes most of network resources to carry out network operations. An attempt has been made in the recent past to avoid this wastage of resources, by exploiting the properties of resource abundant sources in the network. Base station is one such source in wireless sensor network. The base station is resource abundant and less constrained network component in wireless sensor networks. The recent research works have focused more in this direction to explore the benefits of base station characteristics. In this perspective, a novel network partitioning mechanism is proposed here, to build energy efficient wireless sensor networks. The system proposed, distributes network load uniformly with little control overhead on energy resources in the network. The uniform distribution of sensor nodes in every part helps the network to distribute the load uniformly. From simulation results, it is noted that, the proposed system elevates the average lifetime of sensor nodes.

Energy-efficient edge-based network partitioning scheme for wireless sensor networks

Wireless sensor networks (WSNs) are made up of large number of sensor nodes with restricted power resources and storage capacity. As it is necessary to utilize the limited power of each node very efficiently. Therefore it is essential to design an improved chain-based routing protocol for enhancing the lifetime of the network. Among all the existing routing protocols, chain-based routing is one of the most suitable routing method, but there are still some drawbacks like that redundant (detour) transmission and propagation delay are concord with existing schemes presented in literature. To overcome this problem, in this paper we propose a new chain based routing protocol called improved chain-based routing protocol for edge-based WSN (improved CHIRON). In existing CHIRON, area of all groups are not same and group's area increases with moving away from base station (BS). So that the farthest group having longer chain length as compare to nearest group. This will produce larger delay in data propagation between sensor nodes and base station. In our proposed approach the network model is designed such that the groups which are farthest from base station has same chain length like nearest groups therefore data propagation delay becomes less in our proposed approach and overall network lifetime is improved. In this paper we discussed the network model of our proposed protocol for distributing the load of whole network uniformly, we divide the network region into smaller group areas of equal sizes.

Improved energy-efficient chain-based routing protocol for edge-based wireless sensor networks

Wireless Sensor Networks (WSNs) are gaining much importance due to their varied characteristics and the ease with which they can be implemented in various environments to suit different purposes. The sensor nodes which are the main components of WSNs are typically battery equipped and difficult to recharge. Hence, the primary concern while designing such networks is to reduce the overall power consumption in order to prolong the network lifetime An efficient energy conservation technique and algorithm in order to generate a network with desired properties while reducing sensor's energy consumption are discussed and shown through simulation in this paper. Here we have proposed an algorithm, which does not have a fixed infrastructure ie., it is Ad-Hoc in nature, for reducing the overall energy usage by means of periodic coordination amongst Gateway Nodes and Base station.

An power efficient algorithm for distributed ad-hoc cluster based Wireless Sensor Networks

To promise low energy consumption for wireless sensor network routing, a number of routing protocols have been published. A novel routing protocol called BeamStar was proposed in [6]. In BeamStar, each base station uses a directional antenna with power control to assist locating sensors. It shifts the burden of network control and management from resource-limited sensors to resource-abundant and more sophisticate base stations, but still has three serious problems. The different size between the nearer and farther region, base station's scanning time, and a great quantity of inter-node communication all waste precious energy. In the cause of solving these problems, we present a routing protocol, namely Cluster-based BeamStar (CBS), for wireless sensor networks. CBS follows cluster-based structure to decrease the volume of inter-node communication and we have reformed the scanning manner in BeamStar. Our simulations show that CBS is scalable, low-cost, and energy efficient.

Hao-Li Wang

Papers

A Cluster-Based Data Routing for Wireless Sensor Networks