Sciweavers

61 search results - page 2 / 13
» Minimum energy disjoint path routing in wireless ad-hoc netw...
Sort
View
CORR
2010
Springer
299views Education» more  CORR 2010»
13 years 4 months ago
A New Energy Efficient Routing Algorithm Based on a New Cost Function in Wireless Ad hoc Networks
Wireless ad hoc networks are power constrained since nodes operate with limited battery energy. Thus, energy consumption is crucial in the design of new ad hoc routing protocols. I...
Mehdi Lotfi, Sam Jabbehdari, Majid Asadi Shahmirza...
SIGMOBILE
2002
98views more  SIGMOBILE 2002»
13 years 4 months ago
An on-demand minimum energy routing protocol for a wireless ad hoc network
Sheetalkumar Doshi, Shweta Bhandare, Timothy X. Br...
SOFSEM
2007
Springer
13 years 11 months ago
Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
Markus Maier, Steffen Mecke, Dorothea Wagner
WINET
2010
158views more  WINET 2010»
13 years 3 months ago
Joint multi-cost routing and power control in wireless ad hoc networks
Abstract In this work we study the combination of multicost routing and adjustable transmission power in wireless ad hoc networks, so as to obtain dynamic energy- and interference-...
Nikolaos Karagiorgas, Panagiotis C. Kokkinos, Chri...
ISCC
2003
IEEE
13 years 10 months ago
A Framework for Wireless Ad hoc Networks with a Quasi-Guaranteed Minimum System Lifetime
In previous work, we thoroughly studied the intricate problem of energy conservation in wireless ad hoc networks. Consequently, we proposed a novel framework, namely Quasi-Guarante...
Ahmed M. Safwat, Hossam S. Hassanein, Hussein T. M...