Clustering algorithms for sensor networks and mobile ad hoc networks to improve energy efficiency

Includes bibliographical references (leaves 161-172).Many clustering algorithms have been proposed to improve energy efficiency of ad hoc networks as this is one primary challenge in ad hoc networks. The design of these clustering algorithms in sensor networks is different from that in mobile ad hoc networks in accordance with their specific characteristics and application purposes. A typical sensor network, which consists of stationary sensor nodes, usually has a data sink because of the limitation on processing capability of sensor nodes. The data traffic of the entire network is directional towards the sink. This directional traffic burdens the nodes/clusters differently according to their distance to the sink. Most clustering algorithms assign a similar number of nodes to each cluster to balance the burden of the clusters without considering the directional data traffic. They thus fail to maximize network lifetime. This dissertation proposes two clustering algorithms. These consider the directional data traffic in order to improve energy efficiency of homogeneous sensor networks with identical sensor nodes and uniform node distribution. One algorithm is for sensor networks with low to medium node density. The other is for sensor networks with high node density. Both algorithms organize the clusters in such a way that the cluster load is proportional to the cluster energy stored, thereby equalizing cluster lifetimes and preventing premature node/cluster death. Furthermore, in a homogeneous sensor network with low to medium node density, the clusterhead is maintained in the central area of the cluster through re-clustering without ripple effect to save more energy. The simulation results show that the proposed algorithms improve both the lifetime of the networks and performance of data being delivered to the sink. A typical mobile ad hoc network, which usually consists of moveable nodes, does not have a data sink. Existing energy-efficient clustering algorithms maintain clusters by periodically broadcasting control messages. In a typical mobile ad hoc network, a greater speed of node usually needs more frequent broadcasting. To efficiently maintain the clusters, the frequency of this periodic broadcasting needs to meet the requirement of the potentially maximum speed of node. When the node speed is low, the unnecessary broadcasting may waste significant energy. Furthermore, some clustering algorithms limit the maximum cluster size to moderate the difference in cluster sizes. Unfortunately, the cluster sizes in these algorithms still experience significant difference. The larger clusters will have higher burdens. Some clustering algorithms restrict the cluster sizes between the maximum and minimum limits. The energy required to maintain these clusters within the maximum and minimum sizes is quite extensive, especially when the nodes are moving quickly. Thus, energy efficiency is not optimized

A hop-count and node energy based manet routing protocol

Mobile ad hoc network is a self-configuring network in which all participating nodes are mobile and consist of limited channel bandwidth and energy. Mobile devices are battery operated, and energy efficiency is a major issue for battery-operated devices in mobile ad hoc networks. Routing data packets from source to destination is the challenging task in mobile ad hoc networks due to node mobility and dynamic topology change in the network. Link failure or node energy depletion causes re-routing and establishing a new route from the source node to destination node which consumes extra node energy, reduces connectivity of the network and early partition of the network. Energy-related parameters consideration in routing is an important solution to enhance network lifetime. Several better performing routing schemes are presented and implemented for MANETs. Ad-hoc On-demand Distance Vector (AODV) routing protocol is one which performs well among similar routing protocols for MANET. AODV route selection base on either lowest hop-count or fresh sequence number. Many enhancements to AODV are proposed, which represents a better performance in comparison with original protocol. However, in a large network different paths to the destination could be found with the same hop-count. When efficiency is deliberated for those paths in quickly data transmission, each path performance varies in terms of throughput, end-to-end delay and packet delivery ratio due to the mobility of the nodes in the network. AODV routing protocol and enhancements suggested by other researchers do not give attention to such cases, and this paper proposes Hop-count and Node Energy based Routing Protocol (HNERP) which uses a multi-function routing strategy that incorporates with hop-count and node energy while making the routing decision. The proposed protocol is simulated by using NS2 and results show that HNERP performs better in term of packet delivery ratio and throughput, moreover it increases network lifetime and reduces end-to-end delay

Energy Aware Routing Protocol for Energy Constrained Mobile Ad-hoc Networks

Dynamic topology change and decentralized makes routing a challenging task in mobile ad hoc network. Energy efficient routing is the most challenging task in MANET due to limited energy of mobile nodes. Limited power of batteries typically use in MANET, and this is not easy to change or replace while running communication. Network disorder can occur for many factors but in middle of these factors deficiency of energy is the most significant one for causing broken links and early partition of the network. Evenly distribution of power between nodes could enhance the lifetime of the network, which leads to improving overall network transmission and minimizes the connection request. To discourse this issue, we propose an Energy Aware Routing Protocol (EARP) which considers node energy in route searching process and chooses nodes with higher energy levels. The EARP aim is to establish the shortest route from source to destination that contains energy efficient nodes. The performance of EARP is evaluated in terms of packet delivery ratio, network lifetime, end-to-end delay and throughput. Results of simulation done by using NS2 network simulator shows that EARP can achieve both high throughput and delivery ratio, whereas increase network lifetime and decreases end-to-end delay

Network lifetime extension, power conservation and interference suppression for next generation mobile wireless networks

Two major focus research areas related to the design of the next generation multihop wireless networks are network lifetime extension and interference suppression. In this dissertation, these two issues are addressed. In the area of interference suppression, a new family of projection multiuser detectors, based on a generalized, two-stage design is proposed. Projection multiuser detectors provide efficient protection against undesired interference of unknown power, while preserving simple design, with closed-form solution for error probabilities. It is shown that these detectors are linearly optimal, if the interference power is unknown. In the area of network lifetime extension, a new approach to minimum energy routing for multihop wireless networks in Rayleigh fading channels is proposed. It is based on the concept of power combining, whereby two users transmit same signal to the destination user, emulating transmit diversity with two transmit antennas. Analytical framework for the evaluation of the benefits of power combining, in terms of the total transmit power reduction, is defined. Simulation results, which match closely the analytical results, indicate that significant improvements, in terms of transmit power reduction and network lifetime extension, are achievable. The messaging load, generated by the new scheme, is moderate, and can be further optimized

Performance and energy efficiency in wireless self-organized networks

fi=vertaisarvioitu|en=peerReviewed

Exploiting the power of multiplicity: a holistic survey of network-layer multipath

The Internet is inherently a multipath network: For an underlying network with only a single path, connecting various nodes would have been debilitatingly fragile. Unfortunately, traditional Internet technologies have been designed around the restrictive assumption of a single working path between a source and a destination. The lack of native multipath support constrains network performance even as the underlying network is richly connected and has redundant multiple paths. Computer networks can exploit the power of multiplicity, through which a diverse collection of paths is resource pooled as a single resource, to unlock the inherent redundancy of the Internet. This opens up a new vista of opportunities, promising increased throughput (through concurrent usage of multiple paths) and increased reliability and fault tolerance (through the use of multiple paths in backup/redundant arrangements). There are many emerging trends in networking that signify that the Internet's future will be multipath, including the use of multipath technology in data center computing; the ready availability of multiple heterogeneous radio interfaces in wireless (such as Wi-Fi and cellular) in wireless devices; ubiquity of mobile devices that are multihomed with heterogeneous access networks; and the development and standardization of multipath transport protocols such as multipath TCP. The aim of this paper is to provide a comprehensive survey of the literature on network-layer multipath solutions. We will present a detailed investigation of two important design issues, namely, the control plane problem of how to compute and select the routes and the data plane problem of how to split the flow on the computed paths. The main contribution of this paper is a systematic articulation of the main design issues in network-layer multipath routing along with a broad-ranging survey of the vast literature on network-layer multipathing. We also highlight open issues and identify directions for future work

Recent Developments on Mobile Ad-Hoc Networks and Vehicular Ad-Hoc Networks

This book presents collective works published in the recent Special Issue (SI) entitled "Recent Developments on Mobile Ad-Hoc Networks and Vehicular Ad-Hoc Networks”. These works expose the readership to the latest solutions and techniques for MANETs and VANETs. They cover interesting topics such as power-aware optimization solutions for MANETs, data dissemination in VANETs, adaptive multi-hop broadcast schemes for VANETs, multi-metric routing protocols for VANETs, and incentive mechanisms to encourage the distribution of information in VANETs. The book demonstrates pioneering work in these fields, investigates novel solutions and methods, and discusses future trends in these field

Surveying Position Based Routing Protocols for Wireless Sensor and Ad-hoc Networks

A focus of the scientific community is to design network oriented position-based routing protocols and this has resulted in a very high number of algorithms, different in approach and performance and each suited only to particular applications. However, though numerous, very few position-based algorithms have actually been adopted for commercial purposes. This article is a survey of almost 50 position-based routing protocols and it comes as an aid in the implementation of this type of routing in various applications which may need to consider the advantages and pitfalls of position-based routing. An emphasis is made on geographic routing, whose notion is clarified as a more restrictive and more efficient type of position-based routing. The protocols are therefore divided into geographic and non-geographic routing protocols and each is characterized according to a number of network design issues and presented in a comparative manner from multiple points of view. The main requirements of current general applications are also studied and, depending on these, the survey proposes a number of protocols for use in particular application areas. This aims to help both researchers and potential users assess and choose the protocol best suited to their interest