DELAY-ENERGY AWARE ROUTING PROTOCOL FOR HETEROGENEOUS WIRELESS AD HOC NETWORKS

2006 ◽  
Vol 07 (01) ◽  
pp. 37-49 ◽  
Author(s):  
ARJAN DURRESI ◽  
VAMSI PARUCHURI ◽  
MIMOZA DURRESI ◽  
LEONARD BAROLLI

We present Delay-Energy Aware Routing (DEAP) a novel protocol for heterogeneous wireless ad hoc networks. DEAP is a crosslayer scheme that: first, manages adaptively the energy control by controlling the wakeup cycle of sensors based on the experienced packet delay; and second, rout packet in each hoc by distributing the load a group of neighboring nodes. The primary result of DEAP is that it enables a flexible and wide range of tradeoffs between the packet delay and the energy consumption. Therefore, DEAP supports delay sensitive applications of heterogeneous networks that include sensors and actors. DEAP is scalable to the change in network size, node type, node density and topology. DEAP accommodates seamlessly such network changes, including the presence of actors in heterogeneous sensor networks. Indeed, while DEAP does not count on actors, it takes advantage of them, and uses their resources when possible, thus reducing the energy consumption of sensor nodes. Through analysis and simulation evaluations, we show that DEAP improves the packet delay and network lifetime compared to other protocols.

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).


2011 ◽  
Vol 55 (15) ◽  
pp. 3256-3274 ◽  
Author(s):  
Javad Vazifehdan ◽  
R. Venkatesha Prasad ◽  
Ertan Onur ◽  
Ignas Niemegeers

2010 ◽  
Vol 83 (11) ◽  
pp. 2188-2199 ◽  
Author(s):  
Sudip Misra ◽  
Sanjay K. Dhurandher ◽  
Mohammad S. Obaidat ◽  
Pushkar Gupta ◽  
Karan Verma ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document