Conference Paper

Energy-efficient communication for ad-hoc wireless sensor networks

Massachusetts Inst. of Technol., Cambridge, MA, USA
DOI: 10.1109/ACSSC.2001.986894 Conference: Signals, Systems and Computers, 2001. Conference Record of the Thirty-Fifth Asilomar Conference on, Volume: 1
Source: IEEE Xplore

ABSTRACT The energy dissipated by communication is a key concern in the development of networks of hundreds to thousands of distributed wireless microsensors. To evaluate the dissipation of communication energy in this unique application domain, energy models based on actual microsensor hardware are incorporated into a simulation tool designed expressly for high-density, energy-conscious wireless networks. Assessing and leveraging the energy implications of microsensor hardware and applications is crucial to achieving energy-efficient microsensor network communication.

0 Bookmarks
 · 
119 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Sensor nodes usually have limited energy supply and they are impractical to recharge. How to balance traffic load in sensors in order to increase network lifetime is a very challenging research issue. Many clustering algorithms have been proposed recently for wireless sensor networks (WSNs). However, sensor networks with one fixed sink node often suffer from a hot spots problem since nodes near sinks have more traffic burden to forward during a multi-hop transmission process. The use of mobile sinks has been shown to be an effective technique to enhance network performance features such as latency, energy efficiency, network lifetime, etc. In this paper, a modified Stable Election Protocol (SEP), which employs a mobile sink, has been proposed for WSNs with non-uniform node distribution. The decision of selecting cluster heads by the sink is based on the minimization of the associated additional energy and residual energy at each node. Besides, the cluster head selects the shortest path to reach the sink between the direct approach and the indirect approach with the use of the nearest cluster head. Simulation results demonstrate that our algorithm has better performance than traditional routing algorithms, such as LEACH and SEP.
    Sensors 01/2013; 13(11):14301-14320. · 2.05 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The wireless sensor networks combines sensing, computation, and communication into a single small device. These devices depend on battery power and may be placed in hostile environments replacing them becomes a tedious task. Thus improving the energy of these networks becomes important. Clustering in wireless sensor network looks several challenges such as selection of an optimal group of sensor nodes as cluster, optimum selection of cluster head, energy balanced optimal strategy for rotating the role of cluster head in a cluster, maintaining intra and inter cluster connectivity and optimal data routing in the network. In this paper, we study a protocol supporting an energy efficient clustering, cluster head selection and data routing method to extend the lifetime of sensor network. Simulation results demonstrate that the proposed protocol prolongs network lifetime due to the use of efficient clustering, cluster head selection and data routing. The results of simulation show that at the end of some certain part of running the EECS and Fuzzy based clustering algorithm increases the number of alive nodes comparing with the LEACH and HEED methods and this can lead to an increase in sensor network lifetime. By using the EECS method the total number of messages received at base station is increased when compared with LEACH and HEED methods. The Fuzzy based clustering method compared with the K-Means Clustering by means of iteration count and time taken to die first node in wireless sensor network, as the result shows that the fuzzy based clustering method perform well than kmeans clustering methods.
    12/2013;
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Wireless sensor networks (WSNs) comprising of tiny, power-constrained nodes are gaining popularity due to their potential use in a wide range of applications, including monitoring of environmental attributes, intrusion detection, and various military and civilian environments. While the sensing objectives of these environments are unique and application dependent, a common performance criteria for wireless sensor networks is prolonging network lifetime while satisfying coverage and connectivity in the deployment region. In many real-world scenarios, reoccurring spatial patterns of occurrence could be identified in the sensed event information. This paper proposes a new routing algorithm schema based on event occurrence history to secure K-Coverage of event paths and maintain the maximum degree of coverage. In the proposed method the nodes located around event path try to save their battery power by not participating in data packet forwarding to neighbor nodes. The simulation results show that the proposed method improves network lifetime by shifting the routing responsibility from sensing nodes to communication nodes, while maximizing the degree of coverage in the main path of event occurrence. As a consequence, the lifetime of main path coverage is increased dramatically as compared to previous methods.
    International Journal of Distributed Sensor Networks 01/2012; 2012. · 0.92 Impact Factor

Full-text (2 Sources)

Download
1 Download
Available from