Sciweavers

462 search results - page 70 / 93
» Route Optimization with Additional Destination-Information i...
Sort
View
ICCNMC
2005
Springer
14 years 1 months ago
Minimum Disc Cover Set Construction in Mobile Ad Hoc Networks
— The minimum disc cover set can be used to construct the dominating set on the fly for energy-efficient communications in mobile ad hoc networks. The approach used to compute ...
Min-Te Sun, Xiaoli Ma, Chih-Wei Yi, Chuan-Kai Yang...
P2P
2005
IEEE
189views Communications» more  P2P 2005»
14 years 1 months ago
Proximity Neighbor Selection for a DHT in Wireless Multi-Hop Networks
A mobile ad hoc network (MANET) is a multi-hop wireless network having no infrastructure. Thus, the mobile nodes have to perform basic control tasks, such as routing, and higher-l...
Curt Cramer, Thomas Fuhrmann
LCN
2006
IEEE
14 years 1 months ago
Optimal Multi-hop Cellular Architecture for Wireless Communications
Multi-hop relaying is an important concept in future generation wireless networks. It can address the inherent problems of limited capacity and coverage in cellular networks. Howe...
Yik Hung Tam, Hossam S. Hassanein, Selim G. Akl, R...
IJNSEC
2006
162views more  IJNSEC 2006»
13 years 7 months ago
Detecting and Evading Wormholes in Mobile Ad-hoc Wireless Networks
Mobile ad-hoc wireless networks are established in improvised environments through the mutual cooperation of its participating nodes. These nodes often operate in a physically ins...
Asad Amir Pirzada, Chris McDonald
TAMC
2009
Springer
14 years 2 months ago
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
Maren Martens