Sciweavers

415 search results - page 22 / 83
» Reactive routing overhead in networks with unreliable nodes
Sort
View
NAS
2010
IEEE
13 years 7 months ago
CR: Capability Information for Routing of Wireless Ad Hoc Networks in the Real Environment
—In greedy routing, each relay node forwards the message to a neighbor (also called successor) that is closer to the destination. However, the successor candidate set (SCS) is di...
Zhen Jiang, Zhigang Li, Nong Xiao, Jie Wu
CN
2006
166views more  CN 2006»
13 years 8 months ago
GLR: A novel geographic routing scheme for large wireless ad hoc networks
Wireless ad hoc routing has been extensively studied and many clever schemes have been proposed over the last several years. One class of ad hoc routing is geographic routing wher...
Jongkeun Na, Chong-kwon Kim
PAKDD
2007
ACM
238views Data Mining» more  PAKDD 2007»
14 years 2 months ago
A Distributed and Cooperative Black Hole Node Detection and Elimination Mechanism for Ad Hoc Networks
A mobile node in ad hoc networks may move arbitrarily and acts as a router and a host simultaneously. Such a characteristic makes nodes in MANET vulnerable to potential attacks. Th...
Chang-Wu Yu, Tung-Kuang Wu, Rei-Heng Cheng, Shun C...
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 8 months ago
Secured Greedy Perimeter Stateless Routing for Wireless Sensor Networks
Wireless sensor networks are collections of large number of sensor nodes. The sensor nodes are featured with limited energy, computation and transmission power. Each node in the n...
P. Samundiswary, D. Sathian, P. Dananjayan
AINA
2008
IEEE
14 years 3 months ago
Geographical Routing in Intermittently Connected Ad Hoc Networks
In intermittently connected ad hoc networks standard routing protocols like AODV, DSR and GPSR fail since they generally cannot find a contemporaneous path from source to destinat...
Erik Kuiper, Simin Nadjm-Tehrani