426 search results - page 8 / 86 » Routing with Mutual Information Accumulation in Wireless Net... |
NAS
2010
IEEE
13 years 5 months ago
2010
IEEE
—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...
VTC
2010
IEEE
13 years 5 months ago
2010
IEEE
—Most of geographic routing approaches in wireless ad hoc and sensor networks do not take into consideration the medium access control (MAC) and physical layers when designing a ...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
—Although network-wide flooding in reactive routing protocols like AODV [1] facilitates the discovery of optimal routes, they engender large control overhead. Some efficient floo...
MSWIM
2003
ACM
13 years 12 months ago
2003
ACM
Recently, geographic routing in wireless networks has gained attention due to several advantages of location information. Location information eliminates the necessity to set up a...
CAI
2002
Springer
13 years 6 months ago
2002
Springer
In a localized routing algorithm, node A currently holding the message forwards it based on the location of itself, its neighboring nodes and destination. We propose to use depth ...