An Energy Aware Network Construction and Routing Method for Wireless Sensor Network

Abstract

In Wireless Sensor Networks (WSNs) where deployed sensors are not stationary, the most important demand of is to design a cost effective and reliable network. This paper proposes an energy aware network construction and routing scheme, which is based on the hierarchical approach to distribute the task in some sensors in order to prolong the network lifetime. It aims to make even the energy consumption on constitute nodes. With the node hierarchy, the sink initiates the construction by electing gateway nodes in the network and the elected gateway nodes participate to form logical clusters by electing a cluster head in each cluster. Then, the cluster heads aggregate data from the sensing sensors and transmit the data to the sink through the gateway. Our simulation result illustrates that the proposed scheme provides a basement to reduce the source of energy dissipation in network construction, and as well as in data routing. Here, the notable issue comes from dynamic topology along with node mobility in order to design a well-consolidate network for gathering information. The rest of the paper is organized as follows. We briefly discuss the related works in section Ⅱ. We explain ECR as details in section Ⅲ. Our simulation results are presented in section Ⅳ. Section V presents our conclusions. Keywords Ⅱ. Related WorksSeveral network models for WSN, such as DLER [1] , PEGASIS [2] , TEEN [3] , are proposed in terms of the static scenario of sensor nodes. In practice, however, the node mobility feature is strongly required in many application areas such as location tracking. In the dynamic topology, cluster based network modeling and hierarchical routing protocol are widely adopted as discussed below. landmarks and transmit it to at most X distance for all deployed sensors in the network. Each node maintains the HVC chart to get the auxiliary routing path to transmit data to the sink using the greedy forwarding method. With this method, the problem is that it leads to the large number of control packets and consumes more energy to construct a virtual coordinate system and to maintain the chart. RGR[6] is based on geographic and optimistic forwarding routing. The assumption behind this protocol, a node is aware about the location of itself as well as the neighbor's location, where location information can be exchanged using one-hop beacon or piggyback in the data packet's header. When a source wants to transmit a packet, it gets the location of the destination first and then attaches it to the packet header together with its own location.This protocol is not efficient in the energy dissipation because data or control packet overhead will be increased due to the location tracking information for the neighboring nodes in each transmission.EER [7] assumed that two CHs are required to support the mobility of nodes inside a cluster. Over the CHs, a GN is responsible to forward data to the sink and performed an additional task to find out the missing node from the CH. This approach leads to increase the number of de...