36,650 research outputs found
Poster Abstract: Opportunistic RPL
Sensor nodes constituting Wireless Sensor Networks (WSN) are often battery-
operated and have limited resources. To save energy, nodes sleep most of the
time, and wake up periodically to handle communication. Such radio duty cycling
poses a basic trade-off between energy and latency.
In previous work, we have shown that opportunistic routing is an efficient way
to achieve low-latency yet energy efficient data collection in WSN (ORW [3]).
In this paper, we extend this approach to the context of low-power IP networks,
where nodes need to be addressed individually and where traffic patterns are
irregular. We present ORPL, an opportunistic extension of RPL, the stan-
dard, state-of-the-art routing protocol for low-power IP networks. We discuss
our preliminary results obtained with Contiki in a 137-node testbed
Performance analysis of a novel decentralised MAC protocol for cognitive radio networks
Due to the demand of emerging Cognitive Radio (CR) technology to permits using the unused licensed spectrum parts by cognitive users (CUs) to provide opportunistic and efficient utilisation of the white spaces. This requires deploying a CR MAC with the required characteristics to coordinate the spectrum access among CUs. Therefore, this paper presents the design and implementation of a novel Medium Access Control (MAC) protocol for decentralised CRNs (MCRN). The protocol provides efficient utilisations of the unused licensed channels and enables CUs to exchange data successfully over licensed channels. This is based on the observation procedure of sensing the status of the Licensed Users (LUs) are ON or OFF over the licensed channels. The protocol is validated with the comparison procedure against two different benchmark protocols in terms of the network performance; communication time and throughput. Therefore, performance analysis demonstrated that the proposed MCRN perform better and achieve higher throughput and time benefits than the benchmarks protocols
Review on energy efficient opportunistic routing protocol for underwater wireless sensor networks
Currently, the Underwater Sensor Networks (UWSNs) is mainly an interesting area due to its ability to provide a technology to gather many valuable data from underwater environment such as tsunami monitoring sensor, military tactical application, environmental monitoring and many more. However, UWSNs is suffering from limited energy, high packet loss and the use of acoustic communication. In UWSNs most of the energy consumption is used during the forwarding of packet data from the source to the destination. Therefore, many researchers are eager to design energy efficient routing protocol to minimize energy consumption in UWSNs. As the opportunistic routing (OR) is the most promising method to be used in UWSNs, this paper focuses on the existing proposed energy efficient OR protocol in UWSNs. This paper reviews the existing proposed energy efficient OR protocol, classifying them into 3 categories namely sender-side-based, receiver-side-based and hybrid. Furthermore each of the protocols is reviewed in detail, and its advantages and disadvantages are discussed. Finally, we discuss potential future work research directions in UWSNs, especially for energy efficient OR protocol design
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
Recommended from our members
GSAF: efficient and flexible geocasting for opportunistic networks
With the proliferation of smartphones and their advanced connectivity capabilities, opportunistic networks have gained a lot of traction during the past years; they are suitable for increasing network capacity and sharing ephemeral, localised content. They can also offload traffic from cellular networks to device-to-device ones, when cellular networks are heavily stressed. Opportunistic networks can play a crucial role in communication scenarios where the network infrastructure is inaccessible due to natural disasters, large-scale terrorist attacks or government censorship. Geocasting, where messages are destined to specific locations (casts) instead of explicitly identified devices, has a large potential in real world opportunistic networks, however it has attracted little attention in the context of opportunistic networking. In this paper we propose Geocasting Spray And Flood (GSAF), a simple but efficient and flexible geocasting protocol for opportunistic, delay-tolerant networks. GSAF follows a simple but elegant and flexible approach where messages take random walks towards the destination cast. Messages that follow directions away from the cast are extinct when the device buffer gets full, freeing space for new messages to be delivered. In GSAF, casts do not have to be pre-defined; instead users can route messages to arbitrarily defined casts. Our extensive evaluation shows that GSAF is efficient, in terms of message delivery ratio and latency as well as network overhead
Cross-layer Balanced and Reliable Opportunistic Routing Algorithm for Mobile Ad Hoc Networks
For improving the efficiency and the reliability of the opportunistic routing
algorithm, in this paper, we propose the cross-layer and reliable opportunistic
routing algorithm (CBRT) for Mobile Ad Hoc Networks, which introduces the
improved efficiency fuzzy logic and humoral regulation inspired topology
control into the opportunistic routing algorithm. In CBRT, the inputs of the
fuzzy logic system are the relative variance (rv) of the metrics rather than
the values of the metrics, which reduces the number of fuzzy rules
dramatically. Moreover, the number of fuzzy rules does not increase when the
number of inputs increases. For reducing the control cost, in CBRT, the node
degree in the candidate relays set is a range rather than a constant number.
The nodes are divided into different categories based on their node degree in
the candidate relays set. The nodes adjust their transmission range based on
which categories that they belong to. Additionally, for investigating the
effection of the node mobility on routing performance, we propose a link
lifetime prediction algorithm which takes both the moving speed and moving
direction into account. In CBRT, the source node determines the relaying
priorities of the relaying nodes based on their utilities. The relaying node
which the utility is large will have high priority to relay the data packet. By
these innovations, the network performance in CBRT is much better than that in
ExOR, however, the computation complexity is not increased in CBRT.Comment: 14 pages, 17 figures, 31 formulas, IEEE Sensors Journal, 201
- …