Sciweavers

1970 search results - page 30 / 394
» Node Localisation in Wireless Ad Hoc Networks
Sort
View
TPDS
2002
155views more  TPDS 2002»
13 years 8 months ago
Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links
Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad hoc wireless networks. Routing based on a connected dominating set is...
Jie Wu
CSREASAM
2006
13 years 10 months ago
Increasing Security in Mobile Ad Hoc Networks by Incentives to Cooperate and Secure Routing
A mobile ad hoc network is a self-organizing network that relies on the cooperation of participating nodes in order to function properly. In this network, mobile users arrive withi...
Ebrahim Khosravi, Brandy Tyson
LCN
2006
IEEE
14 years 2 months ago
Accuracy-Speedup Tradeoffs for a Time-Parallel Simulation of Wireless Ad hoc Networks
We introduce a scalable algorithm for time-parallel simulations of wireless ad hoc networks and report on our results. Our approach decomposes the simulation into overlapping temp...
Guoqiang Wang, Damla Turgut, Ladislau Böl&oum...
AINTEC
2007
Springer
14 years 2 months ago
Quality-of-Service Multicast Overlay Spanning Tree Algorithms for Wireless Ad Hoc Networks
In this article, we explore modified versions of Multicast Overlay Spanning Tree algorithms (MOST) to support quality of service for wireless ad hoc networks. These algorithms (Q-...
Georgios Rodolakis, Cedric Adjih, Anis Laouiti, Sa...
DIALM
1999
ACM
98views Algorithms» more  DIALM 1999»
14 years 25 days ago
Routing with guaranteed delivery in ad hoc wireless networks
We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is...
Prosenjit Bose, Pat Morin, Ivan Stojmenovic, Jorge...