Sciweavers

235 search results - page 38 / 47
» Scalability of Routing Tables in Wireless Networks
Sort
View
TON
2008
107views more  TON 2008»
13 years 8 months ago
Efficient routing in intermittently connected mobile networks: the multiple-copy case
Abstract--Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are m...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...
PEWASUN
2005
ACM
14 years 2 months ago
Impact of mobility prediction on the temporal stability of MANET clustering algorithms
Scalability issues for routing in mobile ad hoc networks (MANETs) have been typically addressed using hybrid routing schemes operating in a hierarchical network architecture. Seve...
Aravindhan Venkateswaran, Venkatesh Sarangan, Nata...
INFOCOM
2005
IEEE
14 years 2 months ago
Probabilistic QoS guarantee in reliability and timeliness domains in wireless sensor networks
— In this paper, we present a novel packet delivery mechanism called Multi-path and Multi-Speed Routing Protocol (MMSPEED) for probabilistic QoS guarantee in wireless sensor netw...
Emad Felemban, Chang-Gun Lee, Eylem Ekici, Ryan Bo...
ACSAC
2006
IEEE
14 years 2 months ago
Secure Distributed Cluster Formation in Wireless Sensor Networks
In wireless sensor networks, clustering sensor nodes into small groups is an effective technique to achieve scalability, self-organization, power saving, channel access, routing, ...
Kun Sun, Pai Peng, Peng Ning, Cliff Wang
AUTONOMICS
2008
ACM
13 years 10 months ago
Building multicast trees in ad-hoc networks
Multicast trees are used in a variety of applications, such as publish/subscribe systems or content distribution networks. Existing algorithms for ad-hoc networks typically produc...
Raphaël Kummer, Peter G. Kropf, Pascal Felber