Energy Aware Optimized Routing Protocols for Wireless Ad Hoc Sensor Network

Author(s):  
Alok R. Prusty ◽  
Srinivas Sethi ◽  
Ajit Kumar Nayak

Advancement in wireless technology made human life become simple and easy going. Wireless Ad Hoc Sensor Network (WASN) is one of the friendly wireless networks used to monitor the most unfriendly and ever changing dynamic environment that restricts continuous human attention. WASN has drawn significant attentions due to its unique capabilities to deal with complex network operation in highly resource constrained network construct. This ad hoc and unstructured deployment of tiny sensor nodes operate with controlled transmission range, processing capabilities, as well as very limited battery backup. The severe power depletion affects the existence of active nodes. Hence, data forwarding and reliable packet routing in such phenomenon oriented network becoming a challenge. In this chapter the clustering and hierarchical routing approaches for WASN environment has been briefly presented followed by some optimization strategies applicable to cluster routing process. This chapter can help researchers to think fresh dimensions of ongoing research in WASN cluster routing.

2020 ◽  
pp. 1494-1521 ◽  
Author(s):  
Alok R. Prusty ◽  
Srinivas Sethi ◽  
Ajit Kumar Nayak

Advancement in wireless technology made human life become simple and easy going. Wireless Ad Hoc Sensor Network (WASN) is one of the friendly wireless networks used to monitor the most unfriendly and ever changing dynamic environment that restricts continuous human attention. WASN has drawn significant attentions due to its unique capabilities to deal with complex network operation in highly resource constrained network construct. This ad hoc and unstructured deployment of tiny sensor nodes operate with controlled transmission range, processing capabilities, as well as very limited battery backup. The severe power depletion affects the existence of active nodes. Hence, data forwarding and reliable packet routing in such phenomenon oriented network becoming a challenge. In this chapter the clustering and hierarchical routing approaches for WASN environment has been briefly presented followed by some optimization strategies applicable to cluster routing process. This chapter can help researchers to think fresh dimensions of ongoing research in WASN cluster routing.


Author(s):  
Ejaz Ahmed ◽  
Salman Ali ◽  
Adnan Akhunzada ◽  
Ibrar Yaqoob

This chapter provides a review of design practices in network communication for Cognitive Radio Sensor Networks. The basics of networking and Medium Access Control functionalities with focus on data routing and spectrum usage are discussed. Technical differences manifest in various network layouts, hence the role of various specialized nodes, such as relay, aggregator, or gateway in Cognitive Radio Sensor Networks need analysis. Optimal routing techniques suitable for different topologies are also summarized. Data delivery protocols are categorized under priority-based, energy-efficient, ad hoc routing-based, attribute-based, and location-aware routing. Broadcast, unicast, and detection of silence periods are discussed for network operation with slotted or unslotted time. Efficient spectrum usage finds the most important application here involving use of dynamic, opportunistic, and fixed spectrum usage. Finally, a thorough discussion on the open issues and challenges for Cognitive Radio Sensor Network communication and internetworking in Cognitive Radio Sensor Network-based deployments and methods to address them are provided.


Computers ◽  
2019 ◽  
Vol 8 (1) ◽  
pp. 6 ◽  
Author(s):  
Abdallah Sobehy ◽  
Eric Renault ◽  
Paul Muhlethaler

Location services for ad-hoc networks are of indispensable value for a wide range of applications, such as the Internet of Things (IoT) and vehicular ad-hoc networks (VANETs). Each context requires a solution that addresses the specific needs of the application. For instance, IoT sensor nodes have resource constraints (i.e., computational capabilities), and so a localization service should be highly efficient to conserve the lifespan of these nodes. We propose an optimized energy-aware and low computational solution, requiring 3-GPS equipped nodes (anchor nodes) in the network. Moreover, the computations are lightweight and can be implemented distributively among nodes. Knowing the maximum range of communication for all nodes and distances between 1-hop neighbors, each node localizes itself and shares its location with the network in an efficient manner. We simulate our proposed algorithm in a NS-3 simulator, and compare our solution with state-of-the-art methods. Our method is capable of localizing more nodes (≈90% of nodes in a network with an average degree ≈10).


2015 ◽  
Vol 752-753 ◽  
pp. 1413-1418
Author(s):  
Tao Du ◽  
Qing Bei Guo ◽  
Kun Zhang ◽  
Kai Wang

Energy efficiency is a key factor to improve WSNs’ performance, and hierarchical routing algorithms are fitter in large scale networks and have more reliability, so they are mostly used to improve the nodes’ energy efficiency now. In this paper, mainly existing hierarchical routing algorithms are introduced, and based on these researches, a new energy efficient hierarchical routing algorithm designed based on energy aware semi-static clustering method is proposed. In this algorithm named EASCA, the nodes’ residual energy and cost of communication would both be considered when clustering. And a special packet head is defined to update nodes’ energy information when transmitting message; to rotate cluster head automatically, a member management scheme is designed to complete this function; and a re-cluster mechanism is used to dynamic adjust the clusters to make sensor nodes organization more reasonable. At last, EASCA is compared with other typical hierarchical routing algorithms in a series of experiments, and the experiments’ result proves that EASCA has obviously improved WSNs’ energy efficiency.


2015 ◽  
Vol 40 (3) ◽  
pp. 203-222 ◽  
Author(s):  
Sohini Roy

Abstract Wireless Sensor Network (WSN) has emerged as an important supplement to the modern wireless communication systems due to its wide range of applications. The recent researches are facing the various challenges of the sensor network more gracefully. However, energy efficiency has still remained a matter of concern for the researches. Meeting the countless security needs, timely data delivery and taking a quick action, efficient route selection and multi-path routing etc. can only be achieved at the cost of energy. Hierarchical routing is more useful in this regard. The proposed algorithm Energy Aware Cluster Based Routing Scheme (EACBRS) aims at conserving energy with the help of hierarchical routing by calculating the optimum number of cluster heads for the network, selecting energy-efficient route to the sink and by offering congestion control. Simulation results prove that EACBRS performs better than existing hierarchical routing algorithms like Distributed Energy-Efficient Clustering (DEEC) algorithm for heterogeneous wireless sensor networks and Energy Efficient Heterogeneous Clustered scheme for Wireless Sensor Network (EEHC).


2019 ◽  
Vol 8 (4) ◽  
pp. 12377-12385

Wireless sensor network is formed with limited energy resources, easily compromised by an adversary because of hostile environments. Adversary may use compromised nodes to inject false reports and launch DoS attacks, thus, sensor nodes are prone to failure and which makes the network topology configurations highly dynamic in real world applications. A variety of en-route filtering schemes have been proposed to drop and defeat these attacks by using their own cryptographic methods. Some of them ask for a fixed path between a base station and each cluster, so they are not feasible for dynamic network. Additionally, other proposals do not consider various environmental variables in a dynamic environment, so they only choose static paths. In contrast, we consider topology changes, communication costs, the maximum number of key dissemination hops, and the spread of nodes for providing optimum filtering capacity. This paper presents a fuzzy-based adaptive multipath selection method in dynamic environment of a wireless sensor network. Our proposed method can adjust the optimized number of multipaths during key dissemination. Experimental results show that relatively higher filtering capacity with lower energy consumption and suitable nodes for highly dynamic networks.


Author(s):  
Maha Salah Asaad ◽  
Muayad Sadik Croock

A type of distributed and self-regulating network is the wireless sensor network (WSN). The sensor nodes have limited computing capabilities, memory, battery power are needed to ensure a strong security design. In this paper, an adaptive cryptographic scheme for WSN that is operating on routing ad hoc on-demand vector routing (AODV) protocol. The adaptive term refers to the adopted mechanism between heavy and light asymmetric cryptography techniques of RSA. The heavy technique adopts the complete version of RSA algorithm, while the light one considers a reduced complexity version. This is to control the security operation over the included nodes even with low power ratio. In various case studies, the proposed scheme is checked and the result obtained shows the high efficiency of results in terms of protection guarantee.


Sensors ◽  
2019 ◽  
Vol 19 (2) ◽  
pp. 402 ◽  
Author(s):  
Andrea Abrardo ◽  
Alessandro Pozzebon

In this paper, a pervasive monitoring system to be deployed in underground environments is presented. The system has been specifically designed for the so-called “Bottini”, i.e., the medieval aqueducts dug beneath the Centre of Siena, Italy. The results of a measurement campaign carried out in the deployment scenario show that the transmission range of LoRa (Long Range) technology is limited to a maximum of 200 m, thus, making the adoption of a classical star topology impossible. Hence, a Linear Sensor Network topology is proposed based on multi-hop LoRa chain-type communications. In this scenario, an ad-hoc transmission scheme is presented that optimally evaluates the wake-up time of all nodes with the aim of minimizing the average energy dissipation deriving from clock offsets. Numerical results show that the proposed wake-up time optimization leads in the best case to a 50% reduction in power dissipation with respect to a scheme that evaluates the wake-up time in a non-optimal way.


Sign in / Sign up

Export Citation Format

Share Document