Sciweavers

142 search results - page 3 / 29
» Efficient Hop ID based Routing for Sparse Ad Hoc Networks
Sort
View
ICC
2007
IEEE
174views Communications» more  ICC 2007»
13 years 11 months ago
Fairness Improvement and Efficient Rerouting in Mobile Ad Hoc Networks
— Mobile ad hoc networking allows nodes to form temporary networks and communicate with each other possibly via multiple hops. By using a special node called the gateway, an ad h...
Norihiro Ohata, Yongbing Zhang, Yusheng Ji, Xuemin...
TMC
2008
125views more  TMC 2008»
13 years 5 months ago
Distributed Algorithm for Efficient Construction and Maintenance of Connected k-Hop Dominating Sets in Mobile Ad Hoc Networks
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
Hong-Yen Yang, Chia-Hung Lin, Ming-Jer Tsai
ICC
2008
IEEE
141views Communications» more  ICC 2008»
13 years 11 months ago
Greedy Hop Distance Routing Using Tree Recovery on Wireless Ad Hoc and Sensor Networks
—Connectivity-based routing protocols use the hop count vector to a group of anchors for packet forwarding. Due to the discrete nature of hop count based coordinates, without an ...
Shao Tao, Akkihebbal L. Ananda, Mun Choon Chan
INFOCOM
2006
IEEE
13 years 11 months ago
Efficient Flooding Scheme Based on 1-Hop Information in Mobile Ad Hoc Networks
—Flooding is one of the most fundamental operations in mobile ad hoc networks. Traditional implementation of flooding suffers from the problems of excessive redundancy of message...
Hai Liu, Peng-Jun Wan, Xiaohua Jia, Xinxin Liu, F....