Sciweavers

1990 search results - page 388 / 398
» Anonymous communications in mobile ad hoc networks
Sort
View
INFOCOM
2000
IEEE
14 years 1 days ago
Energy Conserving Routing in Wireless Ad-hoc Networks
— An ad-hoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor based, monitoring system. Information is generated in certain nodes and need...
Jae-Hwan Chang, Leandros Tassiulas
IWDC
2005
Springer
138views Communications» more  IWDC 2005»
14 years 1 months ago
Hierarchical Routing in Sensor Networks Using k-Dominating Sets
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
Michael Q. Rieck, Subhankar Dhar
MOBICOM
2009
ACM
14 years 2 months ago
Neighbor discovery in wireless networks and the coupon collector's problem
—Neighbor discovery1 is one of the first steps in the initialization of a wireless ad hoc network. In this paper, we design and analyze practical algorithms for neighbor discove...
Sudarshan Vasudevan, Donald F. Towsley, Dennis Goe...
MSWIM
2006
ACM
14 years 1 months ago
Establishing how many VoIP calls a wireless LAN can support without performance degradation
The use of Voice IP (VoIP) over wireless local area networks (WLAN) is a topic of great interest in the research arena. This paper attempts to answer the question: how many VoIP c...
Ángel Cuevas Rumín, Eur Ing Chris Gu...
EURONGI
2005
Springer
14 years 1 months ago
Receiver Oriented Trajectory Based Forwarding
Abstract— Trajectory Based Forwarding (TBF) is a new approach to routing in ad hoc wireless networks. It exploits node position information and, similarly to source routing, requ...
Antonio Capone, Ilario Filippini, Luigi Fratta, Lu...