Sciweavers

404 search results - page 33 / 81
» Social Welfare Based Routing in Ad hoc Networks
Sort
View
ISCC
2005
IEEE
104views Communications» more  ISCC 2005»
14 years 2 months ago
Bandwidth Guaranteed Routing for Ad Hoc Networks with Interference Consideration
The problem of computing bandwidth guaranteed paths for given flow requests in an ad-hoc network is complicated because neighboring links share the medium. We define the path wi...
Zhanfeng Jia, Rajarshi Gupta, Jean C. Walrand, Pra...

Publication
137views
15 years 6 months ago
Optimal Flooding Protocol for Routing in Ad-Hoc Networks
Location discovery is a fundamental problem in wireless ad hoc networks. Most of the ad hoc routing protocols use some form of flooding to discover the location and route of a mobi...
Vamsi K. Parachuri, Arjan Durresi, Durga S. Dash, ...
MSWIM
2004
ACM
14 years 2 months ago
Experimental evaluation of wireless simulation assumptions
All analytical and simulation research on ad hoc wireless networks must necessarily model radio propagation using simplifying assumptions. Although it is tempting to assume that a...
David Kotz, Calvin C. Newport, Robert S. Gray, Jas...
APNOMS
2006
Springer
14 years 17 days ago
Zone-Based Clustering for Intrusion Detection Architecture in Ad-Hoc Networks
Setting up an IDS architecture on ad-hoc network is hard because it is not easy to find suitable locations to setup IDS's. One way is to divide the network into a set of clust...
Il-Yong Kim, Yoo-Sung Kim, Ki-Chang Kim
ISPAN
2002
IEEE
14 years 1 months ago
On Locality of Dominating Set in Ad Hoc Networks with Switch-On/Off Operations
Routing based on a connected dominating set is a promising approach, where the search space for a route is reduced to the hosts in the set. A set is dominating if all the hosts in...
Jie Wu, Fei Dai