Article

AM-DisCNT: Angular Multi-hop DIStance based Circular Network Transmission Protocol for WSNs

Authors:
To read the full-text of this research, you can request a copy directly from the authors.

Abstract

The nodes in wireless sensor networks (WSNs) contain limited energy resources, which are needed to transmit data to base station (BS). Routing protocols are designed to reduce the energy consumption. Clustering algorithms are best in this aspect. Such clustering algorithms increase the stability and lifetime of the network. However, every routing protocol is not suitable for heterogeneous environments. AM-DisCNT is proposed and evaluated as a new energy efficient protocol for wireless sensor networks. AM-DisCNT uses circular deployment for even consumption of energy in entire wireless sensor network. Cluster-head selection is on the basis of energy. Highest energy node becomes CH for that round. Energy is again compared in the next round to check the highest energy node of that round. The simulation results show that AM-DisCNT performs better than the existing heterogeneous protocols on the basis of network lifetime, throughput and stability of the system.

No full-text available

Request Full-text Paper PDF

To read the full-text of this research,
you can request a copy directly from the authors.

... Moreover, iAM-DisCNT is aided with linear-programming-based mathematical models for data flow maximization and packet drop minimization. Here, it is important to mention that section ''The proposed protocol: AM-DisCNT'' summarizes our previous work in Rao et al. 11 and section ''Extending AM-DisCNT: iAM-DisCNT'' includes the improvements made to our previous work. ...
Article
In this paper, we propose two new routing protocols for Wireless Sensor Networks (WSNs). First one is Angular Multi-hop Distance based Clustering Network Transmission (AM-DisCNT) protocol which uses circular deployment of sensors (nodes) for uniform energy consumption in the network. The protocol operates in such a way that nodes with maximum residual energy are selected as Cluster Heads (CHs) for each round. Second one is improved AM-DisCNT (iAM-DisCNT) protocol which exploits both mobile and static Base Stations (BSs) for throughput maximization. Besides the proposition of routing protocols, iAM-DisCNT is provided with three mathematical models; two linear programming based models for information flow maximization and packet drop rate minimization, and one model for calculating energy consumption of nodes. Graphical analysis for linear programming based mathematical formulation is also part of this work. Simulation results show that AM-DisCNT has 32%, and iAM- DisCNT has 48% improved stability period as compared to LEACH and DEEC routing protocols. Similarly, throughput of AM-DisCNT and iAM-DisCNT are improved 16% and 80%, respectively, in comparison to the counterpart schemes.
... Regarding the type of the application, hundreds, even thousands, of sensor nodes are scattered to the environment [9]. In many cases, substituting the energy depleted node for the new one can be dangerous, infeasible, time-consuming, costly, or impossible [10]. Thus, depending on the type of the application, WSNs should maintain durability long enough without any human 2 International Journal of Distributed Sensor Networks intervention after the initial deployment stage [11]. ...
Full-text available
Article
Regarding the energy shortage problem of wireless sensor networks (WSNs), various schemes and protocols are proposed to prolong the network lifetime. Data communication is undoubtedly the most important determinant for this energy scarce network type. In this paper, we propose a sophisticated architecture comprising data reduction, load balance, and topology control. Data reduction is ensured by the parameter spatial correlation proximity range (SCPR) that can be adjusted statically at the setup phase or dynamically revised depending on the necessities in the network. Four-layer virtual architecture is applied for implementing topology control. Furthermore, network area is partitioned into fixed-size hexagonal clusters. Depending on the regions in which the clusters take place, cluster heads (CHs) are elected from the respective subregions of the clusters. Load balance is achieved by considering residual energies and distances to the sink during both CH election and data transmission stages. Aggregated data in each cluster is transmitted towards the sink by using a load balancing single-hop intercluster routing protocol instead of direct transmission as offered in LEACH. Simulation results demonstrate that the proposed architecture ECMTADR shows almost 50% better performance in terms of energy conservation and network lifetime when it is compared to LEACH and HEED.
Full-text available
Article
In this paper, we propose the mobility of a sink in improved energy efficient PEGASIS-based protocol (IEEPB) to advance the network lifetime of Wireless Sensor Networks (WSNs). The multi-head chain, multi-chain concept and the sink mobility affects largely in enhancing the network lifetime of wireless sensors. Thus, we recommend Mobile sink improved energy-efficient PEGASIS-based routing protocol (MIEEPB); a multi-chain model having a sink mobility, to achieve proficient energy utilization of wireless sensors. As the motorized movement of mobile sink is steered by petrol or current, there is a need to confine this movement within boundaries and the trajectory of mobile sink should be fixed. In our technique, the mobile sink moves along its trajectory and stays for a sojourn time at sojourn location to guarantee complete data collection. We develop an algorithm for trajectory of mobile sink. We ultimately perform wide-ranging experiments to assess the performance of the proposed method. The results reveal that the proposed way out is nearly optimal and also better than IEEPB in terms of network lifetime.
Full-text available
Article
We study the impact of heterogeneity of nodes, in terms of their energy, in wireless sensor networks that are hierarchically clustered. In these networks some of the nodes become cluster heads, aggregate the data of their cluster members and transmit it to the sink. We assume that a percentage of the population of sensor nodes is equipped with additional energy resources—this is a source of heterogeneity which may result from the initial setting or as the operation of the network evolves. We also assume that the sensors are randomly (uniformly) distributed and are not mobile, the coordinates of the sink and the dimensions of the sensor field are known. We show that the behavior of such sensor networks becomes very unstable once the first node dies, especially in the presence of node heterogeneity. Classical clustering protocols assume that all the nodes are equipped with the same amount of energy and as a result, they can not take full advantage of the presence of node heterogeneity. We propose SEP, a heterogeneous-aware protocol to prolong the time interval before the death of the first node (we refer to as stability period), which is crucial for many applications where the feedback from the sensor network must be reliable. SEP is based on weighted election probabilities of each node to become cluster head according to the remaining energy in each node. We show by simulation that SEP always prolongs the stability period compared to (and that the average throughput is greater than) the one obtained using current clustering protocols. We conclude by studying the sensitivity of our SEP protocol to heterogeneity parameters capturing energy imbalance in the network. We found that SEP yields longer stability region for higher values of extra energy brought by more powerful nodes.
Full-text available
Conference Paper
This paper presents a resource-aware and link quality based (RLQ) routing metric to address energy limitations, link quality variations, and node heterogeneities in wireless sensor and actor networks (WSANs). The RLQ metric is a combined link cost metric, which is based on both energy efficiency and link quality statistics. The primary objective of the proposed metric is to adapt to varying wireless channel conditions, while exploiting the heterogeneous capabilities in WSANs. Different from most of the existing simulation based studies, this research effort is guided by extensive field experiments of link quality dynamics at various locations over a long period of time using recent sensor platforms, which realistically addresses the real-world wireless communication challenges in WSANs. Performance evaluations, via test-bed experiments, show that the RLQ routing metric achieves high performance in terms of packet reception rate, network throughput and network lifetime.
Full-text available
Conference Paper
Several gateway selection schemes have been proposed that select gateway nodes based on single QoS metric, for instance link availability, link capacity etc. or multiple non-QoS metrics, such as the combination of gateway node speed, residual energy, and number of hops, for mobile ad hoc networks (MANETs). Each scheme just focuses to improve only single network performance such as network throughput, packet delivery ratio, end-to-end delay or packet drop ratio. However, none of those schemes improves overall network performance. To improve the overall network performance, it is necessary to select a gateway with stable connection, maximum link capacity and less latency. In this paper, we propose a gateway selection scheme that considers multiple end-to-end QoS parameters such as route availability period, route capacity and route latency, to select a potential gateway node. The precise estimation and propagation of end-to-end QoS metrics are proposed in this paper. We simulate our gateway selection scheme with a simple hybrid gateway discovery algorithm and it shows that our gateway selection scheme improves throughput, packet delivery ratio with less energy consumption per node. Also it improves the end-to-end delay compared to the single QoS gateway selection schemes.
Full-text available
Conference Paper
Routing protocols for wireless ad hoc networks have traditionally focused on finding paths with minimum hop count. However, such paths can include slow or lossy links, leading to poor throughput. A routing algorithm can select better paths by explicitly taking the quality of the wireless links into account. In this paper, we conduct a detailed, empirical evaluation of the performance of three link-quality metrics---ETX, per-hop RTT, and per-hop packet pair---and compare them against minimum hop count. We study these metrics using a DSR-based routing protocol running in a wireless testbed. We find that the ETX metric has the best performance when all nodes are stationary. We also find that the per-hop RTT and per-hop packet-pair metrics perform poorly due to self-interference. Interestingly, the hop-count metric outperforms all of the link-quality metrics in a scenario where the sender is mobile.
Full-text available
Conference Paper
Wireless sensor networks with thousands of tiny sensor nodes, are expected to find wide applicability and increasing deployment in coming years, as they enable reliable monitoring and analysis of the environment. In this paper, we propose a hybrid routing protocol (APTEEN) which allows for comprehensive information retrieval. The nodes in such a network not only react to time-critical situations, but also give an overall picture of the network at periodic intervals in a very energy efficient manner. Such a network enables the user to request past, present and future data from the network in the form of historical, one-time and persistent queries respectively. We evaluated the performance of these protocols and observe that these protocols are observed to outperform existing protocols in terms of energy consumption and longevity of the network.
Full-text available
Article
The hierarchical clustering technique reduces strongly direct transmissions which consumes hardly the nodes energy. Many new protocols are specifically designed for wireless sensor networks using this strategy, where the objectives are to save energy and extend the network's lifetime. Adapting this approach, we propose a more equitable and stochastic technique which distributes uniformly the energy consumed trough the whole network using a dynamic probability to elect the Cluster Head (CH). This protocol is used for more energy efficiency distribution where the BS is localised far away from the network. Moreover, it is used where the collect data defines the maximum or the minimum values in supervised region. Simulation results show that our protocol enlarges the network lifetime and performances results compared to the Low-Energy Adaptive Clustering Hierarchy (LEACH), the Distributed Energy-Efficient Clustering (DEEC) and the Equitable Distributed Energy-Efficient Clustering (EDEEC).
Full-text available
Article
This paper proposes a load and interference-aware routing metric for wireless mesh networks, named Channel Utilisation and Contention Window Based (C2WB) metric. Our metric assigns weights to individual links which are proportional to the links service times estimated from both channel utilisation and the average contention window of the CSMA/CA mechanism. The path metric, combined from individual link weights, accounts for both load and interference of the links on the path. Thus the C2WB metric helps the routing protocol to balance the traffic and to improve the network capacity by avoiding routing the traffic through congested areas.
Full-text available
Article
Typically, a wireless sensor network contains an important number of inexpensive power constrained sensors which collect data from the environment and transmit them towards the base station in a cooperative way. Saving energy and therefore, extending the wireless sensor networks lifetime, imposes a great challenge. Many new protocols are specifically designed for these raisons where energy awareness is an essential consideration. The clustering techniques are largely used for these purposes.In this paper, we present and evaluate a Stochastic and Balanced Developed Distributed Energy-Efficient Clustering (SBDEEC) scheme for heterogeneous wireless sensor networks. This protocol is based on dividing the network into dynamic clusters. The cluster’s nodes communicate with an elected node called cluster head, and then the cluster heads communicate the information to the base station. SBDEEC introduces a balanced and dynamic method where the cluster head election probability is more efficient. Moreover, it uses a stochastic scheme detection to extend the network lifetime. Simulation results show that our protocol performs better than the Stable Election Protocol (SEP) and than the Distributed Energy-Efficient Clustering (DEEC) in terms of network lifetime. In the proposed protocol the first node death occurs over 90% times longer than the first node death in DEEC protocol and by about 130% than SEP. Postprint (published version)
Full-text available
Conference Paper
Routing metrics play a critical role in wireless mesh networks (WMNs). Several metrics have already been proposed but none of them can effectively capture both local traffic load and hidden node issues. This paper proposes a load and interference-aware routing metric for wireless mesh networks, named contention window based (CWB) metric. Our metric assigns weights to individual links based on both channel utilization and the average contention window used on these links. The individual link weights are combined into path metric that accounts for load balancing and interference between links that use the same channel. Thus the CWB metric helps the routing protocol to balance traffic and improve network capacity by avoiding routing traffic through congested areas. The preliminary quantitative experiments show significant improvement over hop-count based method when using the proposed metric.
Article
In order to prolong the network lifetime, energy-efficient protocols should be designed to adapt the characteristic of wireless sensor networks. Clustering Algorithm is a kind of key technique used to reduce energy consumption, which can increase network scalability and lifetime. This paper studies the performance of clustering algorithm in saving energy for heterogeneous wireless sensor networks. A new distributed energy-efficient clustering scheme for heterogeneous wireless sensor networks is proposed and evaluated. In the new clustering scheme, cluster-heads are elected by a probability based on the ratio between residual energy of node and the average energy of network. The high initial and residual energy nodes will have more chances to be the cluster-heads than the low energy nodes. Simulational results show that the clustering scheme provides longer lifetime and higher throughput than the current important clustering protocols in heterogeneous environments.
Article
Cluster based Wireless Sensor Networks (WSNs) have been widely used for better performance in terms of energy efficiency. Efficient use of energy is challenging task of designing these protocols. Energy holedare created due to quickly drain the energy of a few nodes due to non-uniform distribution in the network. Normally, energy holes make the data routing failure when nodes transmit data back to the base station. We proposedEnergy-efficient HOleRemoving Mechanism (E-HORM) technique to remove energy holes. In this technique, we use sleep and awake mechanism for sensor nodes to save energy. This approach finds the maximum distance node to calculate the maximum energy for data transmission. We considered it as a threshold energy Eth. Every node first checks its energy level for data transmission. If the energy level is less than Eth, it cannot transmit data. We also explain mathematically the energy consumption and average energy saving of sensor nodes in each round. Extensive simulations showed that when use this approach for WSNs significantly helps to extend the network lifetime and stability period.
Article
This paper deals with the routing protocols for distributed wireless sensor networks. The conventional protocols for WSNs like Low Energy adaptive Clustering Hierarchy (LEACH), Stable Election Protocol (SEP), Threshold Sensitive Energy Efficient Network (TEEN), Distributed Energy Efficient Clustering Protocol (DEEC) may not be optimal. We propose a scheme called Away Cluster Head (ACH) which effectively increases the efficiency of conventional clustering based protocols in terms of stability period and number of packets sent to base station (BS). We have implemented ACH scheme on LEACH, SEP, TEEN and DEEC. Simulation results show that LEACHACH, SEP-ACH, TEEN-ACH and DEEC-ACH performs better than LEACH, SEP, TEEN and DEEC respectively in terms of stability period and number of packets sent to BS. The stability period of the existing protocols prolongs by implementing ACH on them.
Article
The clustering algorithm are considered as a kind of key technique used to reduce energy consumption. It can help in increasing the stability period and network life time. Routing protocol for efficient energy utilization should be designed for heterogeneous Wireless Sensor Networks (WSNs). We purpose Hybrid-DEEC (H-DEEC), a chain and cluster based (hybrid) distributed scheme for efficient energy utilization in WSNs. In H-DEEC,elected Cluster Heads (CHs) communicate the Base Station (BS) through beta elected nodes, by using multi-hopping. We logically divide the network into two parts, on the basis of the residual energy of nodes. The normal nodes with high initial and residual energy will behighlyprobable to be CHs than the nodes with lesser energy. To overcome the deficiencies of H-DEEC, we propose Multi-Edged Hybrid-DEEC (MH-DEEC). In MH-DEEC the criteria of chain construction is modified. Finally, the comparison in simulation results with other heterogeneous protocols show that, MH-DEEC and H-DEEC achieves longer stability time and network life time due to efficient energy utilization.
Conference Paper
Being most popular and IETF standard metric, minimum hop count is appropriately used by ad hoc networks, as new paths must rapidly be found in the situations where quality paths could not be found in due time due to high node mobility. There always has been a tradeoff between throughput and energy consumption, but stationary topology of WMNs and high node density of WSN's benefit the algorithms to consider quality-aware routing to choose the best routes. In this paper, we analytically review ongoing research on wireless routing metrics which are based on ETX (expected transmission count) as it performs better than minimum hop count under link availability. Performances over ETX, target platforms and design requirements of these ETX based metrics are high-lighted. Consequences of the criteria being adopted (in addition to expected link layer transmissions & retransmissions) in the form of incremental: (1) performance overheads and computational complexity causing inefficient use of network resources and instability of the routing algorithm, (2) throughput gains achieved with better utilization of wireless medium resources have been elaborated.
Conference Paper
A wireless network consisting of hundreds or thousands of cheap microsensor nodes allow users accurately monitor the characteristics of the remote environment or detect an event. As the sensor nodes have limited energy resources, so the routing protocol designed for the wireless sensor networks should be energy efficient and provide low latency. For this reason, we propose advanced low-energy adaptive clustering hierarchy (ALEACH), a clustering-based protocol architecture where nodes make autonomous decision without any central intervention. ALEACH proposes a new cluster head selection algorithms that enables selecting best suited node for cluster head, algorithms for adaptive clusters and rotating cluster head positions to evenly distribute the energy load among all the nodes. Simulation results show that ALEACH can improve system life time and energy efficiency in terms of different simulation performance metrics.
Conference Paper
Wireless distributed microsensor systems will enable the reliable monitoring of a variety of environments for both civil and military applications. In this paper, we look at communication protocols, which can have significant impact on the overall energy dissipation of these networks. Based on our findings that the conventional protocols of direct transmission, minimum-transmission-energy, multi-hop routing, and static clustering may not be optimal for sensor networks, we propose LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local cluster based station (cluster-heads) to evenly distribute the energy load among the sensors in the network. LEACH uses localized coordination to enable scalability and robustness for dynamic networks, and incorporates data fusion into the routing protocol to reduce the amount of information that must be transmitted to the base station. Simulations show the LEACH can achieve as much as a factor of 8 reduction in energy dissipation compared with conventional outing protocols. In addition, LEACH is able to distribute energy dissipation evenly throughout the sensors, doubling the useful system lifetime for the networks we simulated.
Article
The clustering Algorithm is a kind of key technique used to reduce energy consumption. It can increase the scalability and lifetime of the network. Energy-efficient clustering protocols should be designed for the characteristic of heterogeneous wireless sensor networks. We propose and evaluate a new distributed energy-efficient clustering scheme for heterogeneous wireless sensor networks, which is called DEEC. In DEEC, the cluster-heads are elected by a probability based on the ratio between residual energy of each node and the average energy of the network. The epochs of being cluster-heads for nodes are different according to their initial and residual energy. The nodes with high initial and residual energy will have more chances to be the cluster-heads than the nodes with low energy. Finally, the simulation results show that DEEC achieves longer lifetime and more effective messages than current important clustering protocols in heterogeneous environments.
Article
In this paper, we identify and analyze the requirements to design a new routing link metric for wireless multihop networks. Considering these requirements, when a link metric is proposed, then both the design and implementation of the link metric with a routing protocol become easy. Secondly, the underlying network issues can easily be tackled. Thirdly, an appreciable performance of the network is guaranteed. Along with the existing implementation of three link metrics Expected Transmission Count (ETX), Minimum Delay (MD), and Minimum Loss (ML), we implement inverse ETX; invETX with Optimized Link State Routing (OLSR) using NS-2.34. The simulation results show that how the computational burden of a metric degrades the performance of the respective protocol and how a metric has to trade-off between different performance parameters.
Article
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000. Includes bibliographical references (p. 145-154).
Article
The paper presents a new cluster based routing algorithm that exploits the redundancy properties of the sensor networks in order to address the traditional problem of load balancing and energy efficiency in the WSNs.The algorithm makes use of the nodes in a sensor network of which area coverage is covered by the neighbours of the nodes and mark them as temporary cluster heads. The algorithm then forms two layers of multi hop communication. The bottom layer which involves intra cluster communication and the top layer which involves inter cluster communication involving the temporary cluster heads. Performance studies indicate that the proposed algorithm solves effectively the problem of load balancing and is also more efficient in terms of energy consumption from Leach and the enhanced version of Leach.
Conference Paper
Sensor webs consisting of nodes with limited battery power and wireless communications are deployed to collect useful information from the field. Gathering sensed information in an energy efficient manner is critical to operate the sensor network for a long period of time. In W. Heinzelman et al. (Proc. Hawaii Conf. on System Sci., 2000), a data collection problem is defined where, in a round of communication, each sensor node has a packet to be sent to the distant base station. If each node transmits its sensed data directly to the base station then it will deplete its power quickly. The LEACH protocol presented by W. Heinzelman et al. is an elegant solution where clusters are formed to fuse data before transmitting to the base station. By randomizing the cluster heads chosen to transmit to the base station, LEACH achieves a factor of 8 improvement compared to direct transmissions, as measured in terms of when nodes die. In this paper, we propose PEGASIS (power-efficient gathering in sensor information systems), a near optimal chain-based protocol that is an improvement over LEACH. In PEGASIS, each node communicates only with a close neighbor and takes turns transmitting to the base station, thus reducing the amount of energy spent per round. Simulation results show that PEGASIS performs better than LEACH by about 100 to 300% when 1%, 20%, 50%, and 100% of nodes die for different network sizes and topologies.
Article
In recent years, advances in energy-efficient design and wireless technologies have enabled exciting new applications for wireless devices. These applications span a wide range, including real-time and streaming video and audio delivery, remote monitoring using networked microsensors, personal medical monitoring, and home networking of everyday appliances. While these applications require high performance from the network, they suffer from resource constraints that do not appear in more traditional wired computing environments. In particular, wireless spectrum is scarce, often limiting the bandwidth available to applications and making the channel error-prone, and the nodes are battery-operated, often limiting available energy. My thesis is that this harsh environment with severe resource constraints requires an applicationspecific protocol architecture, rather than the traditional layered approach, to obtain the best possible performance. This dissertation supports this claim using d...
Energy-efcient communication protocol for wireless microsensor networks
  • W R Heinzelman
  • A Chandrakasan
  • H Balakrishnan
W. R. Heinzelman, A. Chandrakasan, H. Balakrishnan, "Energy-efcient communication protocol for wireless microsensor networks", System Sciences, 2000. Proceedings of the 33rd Annual Hawaii International Conference on, pp. 10pp, IEEE, 2000.
Comparison of routing metrics for static multi-hop wireless networks
  • R Draves
  • J Padhye
  • B Zill
R. Draves, J. Padhye, B. Zill, "Comparison of routing metrics for static multi-hop wireless networks", ACM SIGCOMM Computer Communication Review, vol. 34, no. 4, pp. 133144, 2004.
Resource-aware and link quality based routing metric for wireless sensor and actor networks
  • V C Gungor
  • C Sastry
  • Z Song
  • R Integlia
V. C. Gungor, C. Sastry, Z. Song, R. Integlia, "Resource-aware and link quality based routing metric for wireless sensor and actor networks", Communications, 2007. ICC07. IEEE International Conference on, pp. 33643369, IEEE, 2007.