Sciweavers

1498 search results - page 207 / 300
» A Process Calculus for Mobile Ad Hoc Networks
Sort
View
TWC
2010
13 years 2 months ago
Sharp thresholds for relative neighborhood graphs in wireless Ad Hoc networks
In wireless ad hoc networks, relative neighborhood graphs (RNGs) are widely used for topology control. If every node has the same transmission radius, then an RNG can be locally co...
Chih-Wei Yi, Peng-Jun Wan, Lixin Wang, Chao-Min Su
APNOMS
2006
Springer
14 years 1 hour 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
KIVS
2005
Springer
14 years 1 months ago
Epidemic Dissemination of Presence Information in Mobile Instant Messaging Systems
This paper presents an approach for exchanging presence information between users of an instant messaging system in a mobile ad hoc network. As major feature, presence information ...
Christoph Lindemann, Oliver P. Waldhorst
ICDCS
2008
IEEE
14 years 2 months ago
On the Longest RNG Edge of Wireless Ad Hoc Networks
— Relative neighborhood graph (RNG) has been widely used in topology control and geographic routing in wireless ad hoc networks. Its maximum edge length is the minimum requiremen...
Peng-Jun Wan, Lixin Wang, F. Frances Yao, Chih-Wei...
FCSC
2008
104views more  FCSC 2008»
13 years 8 months ago
On automatic verification of self-stabilizing population protocols
The population protocol model [2] has emerged as an elegant computation paradigm for describing mobile ad hoc networks, consisting of a number of mobile nodes that interact with e...
Jun Pang, Zhengqin Luo, Yuxin Deng