E. Royer and C-K. Toh, "A Review of Current Routing Protocols for Ad hoc Wireless Networks", IEEE Personal Communications Magazine, April 1999.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....may be mobile, it is typically the case that once the target site of their sensing application is reached a semi permanent stationary configuration is adopted for the purpose of gathering information. In the area of general ad hoc networks as well as sensor webs, research has focused on routing [3], medium access control (MAC) 4] 5] and physical layer [6] 7] and [8] are protocol suites specifically designed for sensor webs. Theoretical results regarding capacity of general static ad hoc networks first appeared in [9] Also relevant to our research is the so called packet routing problem ....

E.M. Royer and C.-K. Toh, "A review of current routing protocols for ad-hoc wireless networks," IEEE Personal Communications Magazine, pp. 46--55, Apr. 1999.

.... our analytical formulation for computing the optimum trajectory that our gateway ought to follow (Section III) For intra domain node communications, the MANET could rely on well established protocols such as the IEEE 802.11 MAC protocol for media access control [6] DSR, DSDV, or AODV for routing [2], etc. to establish and maintain connectivity. For inter domain node communications, data will have to be routed through the gateway and via the range extension network. III. GATEWAY TRAJECTORY UPDATE ALGORITHM: FORMULATION AND ANALYSIS We now describe the algorithm for determining the ....

....or even piggy backed onto the data payload that is routed to the gateway. This makes the overhead required for gathering state information for the algorithm to be on the same order as that required for the operation of the underlying routing and MAC protocols (routing protocols are discussed in [2]) B. Optimization Complexity The computation of the trajectory itself involves solving a linear program numerically. It is well known that modern interior point LP solvers have a worst case performance of [8] where n is the number of variables in the LP. Thus, for a network of 100 nodes, ....

E. Royer, C.-K. Toh, "A Review of Current Routing Protocols for Ad Hoc Wireless Networks", IEEE Personal Communications Magazine, pp. 46-55, April 1999.

....However, even a combination of both strategies still needs to maintain at least those network paths that are currently in use, limiting the amount of topological changes that can be tolerated within a given amount of time. A survey and comparison of topology based approaches can be found in [RT99] and [BMJ 98] In the following we will focus exclusively on position based routing. Position based routing algorithms eliminate some of the limitations of topology based routing by using additional information. They require that information about the physical position of the participating ....

E. Royer and C.-K. Toh. A review of current routing protocols for ad hoc wireless networks. IEEE Personal Communications, pages 46-55, April 1999.

No context found.

E. Royer and C-K. Toh, "A Review of Current Routing Protocols for Ad hoc Wireless Networks", IEEE Personal Communications Magazine, April 1999.

No context found.

E. M. Royer and C-K Toh, "A Review of Current Routing Protocols for Ad hoc Wireless Networks", IEEE Personal Communication, April 1999, pp. 46-55.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC