1104 search results - page 84 / 221 » Simple Robotic Routing in Ad Hoc Networks |
110
click to vote
NAS
2010
IEEE
14 years 10 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...
122
click to vote
ICC
2009
IEEE
15 years 6 months ago
2009
IEEE
—Routing in ad-hoc networks can consume considerable amount of battery power. However, as the nodes in these networks have limited power, routing is very much energy-constrained....
100
click to vote
MOBIHOC
2005
ACM
15 years 11 months ago
2005
ACM
IEEE 802.11 MAC, called the Distributed Coordination Function (DCF), employs carrier sensing to effectively avoid collisions, but this makes it difficult to maximally reuse the sp...
102
click to vote
MOBIQUITOUS
2005
IEEE
15 years 5 months ago
2005
IEEE
The publish/subscribe model of communication provides sender/receiver decoupling and selective information dissemination that is appropriate for mobile environments characterized ...
GLOBECOM
2008
IEEE
15 years 6 months ago
2008
IEEE
—In many wireless ad-hoc networks it is important to find a route that delivers a message to the destination within a certain deadline (delay constraint). We propose to identify...