5,324 research outputs found
A cross layer multi hop network architecture for wireless Ad Hoc networks
In this paper, a novel decentralized cross-layer multi-hop cooperative network architecture is presented. Our architecture involves the design of a simple yet efficient cooperative flooding scheme,two decentralized opportunistic cooperative forwarding mechanisms as well as the design of Routing
Enabled Cooperative Medium Access Control (RECOMAC) protocol that spans and incorporates the physical, medium access control (MAC) and routing layers for improving the performance of multihop communication. The proposed architecture exploits randomized coding at the physical layer to realize cooperative diversity. Randomized coding alleviates relay selection and actuation mechanisms,and therefore reduces the coordination among the relays. The coded packets are forwarded via opportunistically formed cooperative sets within a region, without communication among the relays and without establishing a prior route. In our architecture, routing layer functionality is submerged into the
MAC layer to provide seamless cooperative communication while the messaging overhead to set up routes, select and actuate relays is minimized. RECOMAC is shown to provide dramatic performance improvements, such as eight times higher throughput and ten times lower end-to-end delay as well as reduced overhead, as compared to networks based on well-known IEEE 802.11 and Ad hoc On Demand
Distance Vector (AODV) protocols
Geographic Gossip: Efficient Averaging for Sensor Networks
Gossip algorithms for distributed computation are attractive due to their
simplicity, distributed nature, and robustness in noisy and uncertain
environments. However, using standard gossip algorithms can lead to a
significant waste in energy by repeatedly recirculating redundant information.
For realistic sensor network model topologies like grids and random geometric
graphs, the inefficiency of gossip schemes is related to the slow mixing times
of random walks on the communication graph. We propose and analyze an
alternative gossiping scheme that exploits geographic information. By utilizing
geographic routing combined with a simple resampling method, we demonstrate
substantial gains over previously proposed gossip protocols. For regular graphs
such as the ring or grid, our algorithm improves standard gossip by factors of
and respectively. For the more challenging case of random
geometric graphs, our algorithm computes the true average to accuracy
using radio
transmissions, which yields a factor improvement over
standard gossip algorithms. We illustrate these theoretical results with
experimental comparisons between our algorithm and standard methods as applied
to various classes of random fields.Comment: To appear, IEEE Transactions on Signal Processin
A novel cooperative opportunistic routing scheme for underwater sensor networks
Increasing attention has recently been devoted to underwater sensor networks (UWSNs) because of their capabilities in the ocean monitoring and resource discovery. UWSNs are faced with different challenges, the most notable of which is perhaps how to efficiently deliver packets taking into account all of the constraints of the available acoustic communication channel. The opportunistic routing provides a reliable solution with the aid of intermediate nodes’ collaboration to relay a packet toward the destination. In this paper, we propose a new routing protocol, called opportunistic void avoidance routing (OVAR), to address the void problem and also the energy-reliability trade-off in the forwarding set selection. OVAR takes advantage of distributed beaconing, constructs the adjacency graph at each hop and selects a forwarding set that holds the best trade-off between reliability and energy efficiency. The unique features of OVAR in selecting the candidate nodes in the vicinity of each other leads to the resolution of the hidden node problem. OVAR is also able to select the forwarding set in any direction from the sender, which increases its flexibility to bypass any kind of void area with the minimum deviation from the optimal path. The results of our extensive simulation study show that OVAR outperforms other protocols in terms of the packet delivery ratio, energy consumption, end-to-end delay, hop count and traversed distance
STiCMAC: A MAC Protocol for Robust Space-Time Coding in Cooperative Wireless LANs
Relay-assisted cooperative wireless communication has been shown to have
significant performance gains over the legacy direct transmission scheme.
Compared with single relay based cooperation schemes, utilizing multiple relays
further improves the reliability and rate of transmissions. Distributed
space-time coding (DSTC), as one of the schemes to utilize multiple relays,
requires tight coordination between relays and does not perform well in a
distributed environment with mobility. In this paper, a cooperative medium
access control (MAC) layer protocol, called \emph{STiCMAC}, is designed to
allow multiple relays to transmit at the same time in an IEEE 802.11 network.
The transmission is based on a novel DSTC scheme called \emph{randomized
distributed space-time coding} (\emph{R-DSTC}), which requires minimum
coordination. Unlike conventional cooperation schemes that pick nodes with good
links, \emph{STiCMAC} picks a \emph{transmission mode} that could most improve
the end-to-end data rate. Any station that correctly receives from the source
can act as a relay and participate in forwarding. The MAC protocol is
implemented in a fully decentralized manner and is able to opportunistically
recruit relays on the fly, thus making it \emph{robust} to channel variations
and user mobility. Simulation results show that the network capacity and delay
performance are greatly improved, especially in a mobile environment.Comment: This paper is a revised version of a paper with the same name
submitted to IEEE Transaction on Wireless Communications. STiCMAC protocol
with RTS/CTS turned off is presented in the appendix of this draf
On the utility of network coding in dynamic environments
Many wireless applications, such as ad-hoc networks and sensor networks, require decentralized operation in dynamically varying environments. We consider a distributed randomized network coding approach that enables efficient decentralized operation of multi-source multicast networks. We show that this approach provides substantial benefits over traditional routing methods in dynamically varying environments. We present a set of empirical trials measuring the performance of network coding versus an approximate online Steiner tree routing approach when connections vary dynamically. The results show that network coding achieves superior performance in a significant fraction of our randomly generated network examples. Such dynamic settings represent a substantially broader class of networking problems than previously recognized for which network coding shows promise of significant practical benefits compared to routing
- …