Sciweavers

1382 search results - page 145 / 277
» Detecting Node Misbehavior in Ad hoc Networks
Sort
View
ICC
2008
IEEE
141views Communications» more  ICC 2008»
16 years 28 days 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
2008
IEEE
16 years 27 days ago
An Information Model for Geographic Greedy Forwarding in Wireless Ad-Hoc Sensor Networks
—In wireless ad-hoc sensor networks, an important issue often faced in geographic greedy forwarding routing is the “local minimum phenomenon” which is caused by deployment ho...
Zhen Jiang, Junchao Ma, Wei Lou, Jie Wu
GLOBECOM
2006
IEEE
16 years 16 days ago
A Novel Semi-Markov Smooth Mobility Model for Mobile Ad Hoc Networks
Abstract— Existing random mobility models have their limitations such as speed decay and sharp turn which have been demonstrated by the previous studies. More importantly, mobili...
Ming Zhao 0001, Wenye Wang
MOBIHOC
2002
ACM
16 years 6 months ago
Message-optimal connected dominating sets in mobile ad hoc networks
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder
AINA
2005
IEEE
16 years 3 days ago
Dynamical Construction of a Core-Based Group-Shared Multicast Tree in Mobile Ad Hoc Networks
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
Bing-Hong Liu, Ming-Jer Tsai, Wei-Chei Ko