1408 search results - page 111 / 282 » Dealing with Node Mobility in Ad Hoc Wireless Network |
174
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—We study throughput-optimal scheduling/routing over mobile ad-hoc networks with time-varying (fading) channels. Traditional back-pressure algorithms (based on the work by Tassiu...
173
click to vote
ITCC
2005
IEEE
15 years 12 months ago
2005
IEEE
Background: Key management in a mobile ad hoc environment is complicated by frequently partitioning network topology. Recently proposed key management systems (KMSs) provide limit...
149
click to vote
LCN
2006
IEEE
16 years 10 days ago
2006
IEEE
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...
152
click to vote
AINTEC
2007
Springer
16 years 16 days ago
2007
Springer
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-...
168
click to vote
DIALM
1999
ACM
15 years 10 months ago
1999
ACM
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...