Sciweavers

1592 search results - page 211 / 319
» Source-Tree Routing in Wireless Networks
Sort
View
102
Voted
SOFSEM
2007
Springer
15 years 6 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
EUC
2006
Springer
15 years 4 months ago
An Energy-Efficient MAC Protocol for Delay-Sensitive Wireless Sensor Networks
Abstract. In this paper, we propose a new medium access control protocol for wireless sensor networks, named LE-MAC (Latency and Energy aware MAC) that aims to minimize data delive...
Changsu Suh, Deepesh Man Shrestha, Young-Bae Ko
92
Voted
SODA
2004
ACM
98views Algorithms» more  SODA 2004»
15 years 2 months ago
End-to-end packet-scheduling in wireless ad-hoc networks
Abstract Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstract...
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...
ICASSP
2009
IEEE
15 years 7 months ago
Cross-layer optimization of wireless fading ad-hoc networks
This paper introduces an algorithm to approximately find optimal wireless networks in presence of fading. Joint optimization of application level rates, routes, link capacities, ...
Nikolaos Gatsis, Alejandro Ribeiro, Georgios B. Gi...
118
Voted
ICASSP
2009
IEEE
15 years 7 months ago
Adaptive distributed transforms for irregularly sampled Wireless Sensor Networks
We develop energy-efficient, adaptive distributed transforms for data gathering in wireless sensor networks. In particular, we consider a class of unidirectional transforms that ...
Godwin Shen, Sunil K. Narang, Antonio Ortega