Results 11 - 20
of
232
GRAdient Broadcast: A Robust Data Delivery Protocol for Large Scale Sensor Networks
- ACM Wireless Networks (WINET
"... Although data forwarding algorithms and protocols have been among the rst set of issues explored in sensor networking, how to reliably deliver sensing data through a vast eld of small, vulnerable sensors remains a research challenge. In this paper we present GRAdient Broadcast (GRAB), a new set of ..."
Abstract
-
Cited by 74 (5 self)
- Add to MetaCart
Although data forwarding algorithms and protocols have been among the rst set of issues explored in sensor networking, how to reliably deliver sensing data through a vast eld of small, vulnerable sensors remains a research challenge. In this paper we present GRAdient Broadcast (GRAB), a new set of mechanisms and protocols which is designed specifically for robust data delivery in face of unreliable nodes and fallible wireless links. Similar to previous work [13, 14], GRAB builds and maintains a cost eld, providing each sensor the direction to forward sensing data. Dierent from all the previous approaches, however, GRAB forwards data along a band of interleaved mesh from each source to the receiver. GRAB controls the width of the band by the amount of credit carried in each data message, allowing the sender to adjust the robustness of data delivery. GRAB design harnesses the advantage of large scale and relies on the collective eorts of multiple nodes to deliver data, without dependency on any individual ones. We have evaluated the GRAB performance through both analysis and extensive simulation. Our analysis shows quantitatively the advantage of interleaved mesh over multiple parallel paths. Our simulation further con rms the analysis results and shows that GRAB can successfully deliver over 90% of packets with relatively low energy cost, even under the adverse conditions of 30% node failures compounded with 15% link message losses.
Modelling Data-Centric Routing in Wireless Sensor Networks
"... Sensor networks differ from traditional networks in several ways: sensor networks have severe energy constraints, redundant low-rate data, and many-to-one flows. The end-to-end routing schemes that have been proposed in the literature for mobile ad-hoc networks are not appropriate under these settin ..."
Abstract
-
Cited by 68 (2 self)
- Add to MetaCart
Sensor networks differ from traditional networks in several ways: sensor networks have severe energy constraints, redundant low-rate data, and many-to-one flows. The end-to-end routing schemes that have been proposed in the literature for mobile ad-hoc networks are not appropriate under these settings. Data-centric technologies are needed that perform in-network aggregation of data to yield energy-efficient dissemination. In this paper we model data-centric routing and compare its performance with traditional end-to-end routing schemes. We examine the impact of source-destination placement and communication network density on the energy costs, delay, and robustness of data aggregation. We show that data-centric routing offers significant performance gains across a wide range of operational scenarios.
A Feedback-Based Scheme for Improving TCP Performance in Ad Hoc Wireless Networks
, 2001
"... Ad hoc networks are completely wireless networks of mobile hosts, in which the topology rapidly changes due to the movement of mobile hosts. This frequent topology change may lead to sudden packet losses and delays. Transport protocols like TCP, which have been designed for reliable fixed networks, ..."
Abstract
-
Cited by 65 (0 self)
- Add to MetaCart
Ad hoc networks are completely wireless networks of mobile hosts, in which the topology rapidly changes due to the movement of mobile hosts. This frequent topology change may lead to sudden packet losses and delays. Transport protocols like TCP, which have been designed for reliable fixed networks, misinterpret this packet loss as congestion and invoke congestion control, leading to unnecessary retransmissions and loss of throughput. To overcome this problem, a feedback scheme is proposed so that the source can distinguish between a route failure and network congestion. When a route is disrupted, the source is sent a Route Failure Notification packet, allowing it to invalidate its timers and stop sending packets. When the route is reestablished, the source is informed through a Route Reestablishment Notification packet, upon which it resumes packet transmissions. Simulation experiments show that in the event of route failures, as the route reestablishment time increases, the use of feedback provides significant improvements in performance.
VADD: Vehicle-assisted data delivery in vehicular ad hoc networks
- DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING, THE PENNSYLVANIA STATE UNIVERSITY, UNIVERSITY
, 2008
"... Multihop data delivery through vehicular ad hoc networks is complicated by the fact that vehicular networks are highly mobile and frequently disconnected. To address this issue, we adopt the idea of carry and forward, where a moving vehicle carries a packet until a new vehicle moves into its vicinit ..."
Abstract
-
Cited by 60 (10 self)
- Add to MetaCart
Multihop data delivery through vehicular ad hoc networks is complicated by the fact that vehicular networks are highly mobile and frequently disconnected. To address this issue, we adopt the idea of carry and forward, where a moving vehicle carries a packet until a new vehicle moves into its vicinity and forwards the packet. Being different from existing carry and forward solutions, we make use of predictable vehicle mobility, which is limited by traffic pattern and road layout. Based on the existing traffic pattern, a vehicle can find the next road to forward the packet to reduce the delay. We propose several vehicle-assisted data delivery (VADD) protocols to forward the packet to the best road with the lowest data-delivery delay. Experimental results show that the proposed VADD protocols outperform existing solutions in terms of packet-delivery ratio, data packet delay, and protocol overhead. Among the proposed VADD protocols, the Hybrid Probe (H-VADD) protocol has a much better performance.
Contention-aware admission control for ad hoc networks
- IEEE Transactions on Mobile Computing
, 2003
"... Abstract—An admission control algorithm must coordinate between flows to provide guarantees about how the medium is shared. In wired networks, nodes can monitor the medium to see how much bandwidth is being used. However, in ad hoc networks, communication from one node may consume the bandwidth of n ..."
Abstract
-
Cited by 51 (3 self)
- Add to MetaCart
Abstract—An admission control algorithm must coordinate between flows to provide guarantees about how the medium is shared. In wired networks, nodes can monitor the medium to see how much bandwidth is being used. However, in ad hoc networks, communication from one node may consume the bandwidth of neighboring nodes. Therefore, the bandwidth consumption of flows and the available resources to a node are not local concepts, but related to the neighboring nodes in carrier-sensing range. Current solutions do not address how to perform admission control in such an environment so that the admitted flows in the network do not exceed network capacity. In this paper, we present a scalable and efficient admission control framework—Contention-aware Admission Control Protocol (CACP)—to support QoS in ad hoc networks. We present several options for the design of CACP and compare the performance of these options using both mathematical analysis and simulation results. We also demonstrate the effectiveness of CACP compared to existing approaches through extensive simulations. Index Terms—Admission control, ad hoc network, multihop, QoS routing, Quality of Service, contention-aware, simulations. 1
Selecting Forwarding Neighbors in Wireless Ad Hoc Networks
, 2001
"... Broadcasting is a fundamental operation which is frequent in wireless ad hoc networks. A simple broadcasting mechanism, known as flooding, is to let every node retransmit the message to all its 1-hop neighbors when receiving the first copy of the message. Despite its simplicity, flooding is very in ..."
Abstract
-
Cited by 46 (3 self)
- Add to MetaCart
Broadcasting is a fundamental operation which is frequent in wireless ad hoc networks. A simple broadcasting mechanism, known as flooding, is to let every node retransmit the message to all its 1-hop neighbors when receiving the first copy of the message. Despite its simplicity, flooding is very inefficient and can result in high redundancy, contention, and collision. One approach to reducing the redundancy is to let each node forward the message only to a small subset of 1-hop neighbors that cover all of the node's 2-hop neighbors. In this paper, we propose two practical heuristics for selecting the minimum number of forwarding neighbors: an O(n log n) time algorithm that selects at most 6 times more forwarding neighbors than the optimum, and an O(n²) time algorithm with an improved approximation ratio of 3, where n is the number of 1- and 2-hop neighbors. The best previously known algorithm, due to Bronnimann and Goodrich [2], guarantees O(1) approximation in O(n³ log n) time.
Localization from connectivity in sensor networks
- IEEE Transactions on Parallel and Distributed Systems
, 2004
"... Abstract—We propose an approach that uses connectivity information—who is within communications range of whom—to derive the locations of nodes in a network. The approach can take advantage of additional information, such as estimated distances between neighbors or known positions for certain anchor ..."
Abstract
-
Cited by 46 (1 self)
- Add to MetaCart
Abstract—We propose an approach that uses connectivity information—who is within communications range of whom—to derive the locations of nodes in a network. The approach can take advantage of additional information, such as estimated distances between neighbors or known positions for certain anchor nodes, if it is available. It is based on multidimensional scaling (MDS), an efficient data analysis technique that takes Oðn 3 Þ time for a network of n nodes. Unlike previous approaches, MDS takes full advantage of connectivity or distance information between nodes that have yet to be localized. Two methods are presented: a simple method that builds a global map using MDS and a more complicated one that builds small local maps and then patches them together to form a global map. Furthermore, least-squares optimization can be incorporated into the methods to further improve the solutions at the expense of additional computation. Through simulation studies on uniform as well as irregular networks, we show that the methods achieve more accurate solutions than previous methods, especially when there are few anchor nodes. They can even yield good relative maps when no anchor nodes are available. Index Terms—Wireless sensor networks, optimization, position estimation. 1
Evaluating Mobility Models Within An Ad Hoc Network
, 2000
"... With current advances in technology, wireless networks are increasing in popularity. Wireless networks allow users the freedom to travel from one location to another without interruption of their computing services. However, wireless networks require the existence of a wired base station (BS) in ord ..."
Abstract
-
Cited by 44 (1 self)
- Add to MetaCart
With current advances in technology, wireless networks are increasing in popularity. Wireless networks allow users the freedom to travel from one location to another without interruption of their computing services. However, wireless networks require the existence of a wired base station (BS) in order for the wireless user to send/receive messages. Ad hoc networks, a subset of wireless networks, allow the formation of a wireless network without the need for a BS. All participating users in an ad hoc network agree to accept and forward messages, to and from each other. With this flexibility, wireless networks have the ability to form anywhere, at any time, as long as two or more wireless users are willing to communicate. In an ad hoc network, the ability to send a message to a group of users, based solely on their geographic location, is desirable. A geocast protocol serves this purpose. Rescue missions, military scenarios, and even advertising schemes benefit from this type of message delivery service. However, before implementation occurs, an ad hoc network protocol such as a geocast protocol must be tested under realistic conditions including, but not limited to, a sensible transmission range, limited buffer for storage of messages, and realistic movements of the wireless users (i.e., a mobility model). The results presented in this thesis focus on several mobility models in an attempt to compare iv the effects that different mobility models have on an ad hoc network protocol. It is obvious that wireless users will travel from one location to another. However, representing their exact movements is not so simple. The results presented in this thesis illustrate the importance in carefully evaluating and implementing multiple mobility models when evaluating an ad hoc net...
A New Approach to On-demand Loop-Free Multipath Routing
, 1999
"... We present and verify ROAM, an on-demand routing algorithm that maintains multiple loop-free paths to destinations. Each router maintains entries only for those destinations for which data flows through the router, which reduces storage space requirements and the amount of bandwidth needed to mainta ..."
Abstract
-
Cited by 41 (1 self)
- Add to MetaCart
We present and verify ROAM, an on-demand routing algorithm that maintains multiple loop-free paths to destinations. Each router maintains entries only for those destinations for which data flows through the router, which reduces storage space requirements and the amount of bandwidth needed to maintain correct routing tables. In ROAM, routes are established and maintained on demand using diffusing computations. A router does not send updates for active destinations, unless its distance to them increases beyond a given threshold. ROAM maintains state that informs routers when a destination is unreachable and prevents routers from sending unnecessary search packets attempting to find paths to an unreachable destination. ROAM is shown to converge in a finite time after an arbitrary sequence of topological changes and is shown to be loop-free at every instant. The time and communication complexities of ROAM are analyzed. Keywords--- On-demand, Loop-Free Routing, Distance vector routing I....
A Probabilistic Emergent Routing Algorithm for Mobile Ad Hoc Networks
, 2003
"... Mobile ad hoc networks are infrastructure-less networks consisting of wireless, possibly mobile nodes which are organized in peer-to-peer and autonomous fashion. The highly dynamic topology, limited bandwidth availability and energy constraints make the routing problem a challenging one. In this pap ..."
Abstract
-
Cited by 40 (0 self)
- Add to MetaCart
Mobile ad hoc networks are infrastructure-less networks consisting of wireless, possibly mobile nodes which are organized in peer-to-peer and autonomous fashion. The highly dynamic topology, limited bandwidth availability and energy constraints make the routing problem a challenging one. In this paper we take a novel approach to the routing problem in MANETs by using swarm inteligenceinspired algorithms. The proposed algorithm uses Ant-like agents to discover and maintain paths in a MANET with dynamic topology. We present simulation results that measure the performance of our algorithm with respect to the characteristics of a MANET, the varying parameters of the algorithm itself as well as performance comparison with other well-known routing protocols.

