Sciweavers

1966 search results - page 156 / 394
» Robust Routing in Wireless Ad Hoc Networks
Sort
View
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
16 years 27 days ago
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
Minming Li, Peng-Jun Wan, F. Frances Yao
PERCOM
2007
ACM
16 years 6 months ago
A three round authenticated group key agreement protocol for ad hoc networks
Group Key Agreement (GKA) protocols enable the participants to derive a key based on each one's contribution over a public network without any central authority. They also pr...
Daniel Augot, Raghav Bhaskar, Valérie Issarny, Da...
IPPS
2006
IEEE
16 years 11 days ago
k-anycast routing schemes for mobile ad hoc networks
— Anycast is a communication paradigm that was first introduced to the suit of routing protocols in IPv6 networks. In anycast, a packet is intended to be delivered to one of the...
Bing Wu, Jie Wu
ICC
2011
IEEE
257views Communications» more  ICC 2011»
14 years 6 months ago
Increasing the Lifetime of Roadside Sensor Networks Using Edge-Betweenness Clustering
Abstract—Wireless Sensor Networks are proven highly successful in many areas, including military and security monitoring. In this paper, we propose a method to use the edge–bet...
Joakim Flathagen, Ovidiu Valentin Drugan, Paal E. ...
ISCIS
2005
Springer
15 years 12 months ago
Admission Control for Multicast Routing with Quality of Service in Ad Hoc Networks
Ad hoc networks, being able to organize themselves without user intervention, can easily provide their users with mobility, multimedia support and group communication. However, the...
Kaan Bür, Cem Ersoy