Low Power, Low Delay: Opportunistic Routing meets Duty Cycling

Traditionally, routing in wireless sensor networks consists of two steps: First, the routing protocol selects a next hop, and, second, the MAC protocol waits for the intended destination to wake up and receive the data. This design makes it difficult to adapt to link dynamics and introduces delays while waiting for the next hop to wake up. In this paper we introduce ORW, a practical opportunistic routing scheme for wireless sensor networks. In a dutycycled setting, packets are addressed to sets of potential receivers and forwarded by the neighbor that wakes up first and successfully receives the packet. This reduces delay and energy consumption by utilizing all neighbors as potential forwarders. Furthermore, this increases resilience to wireless link dynamics by exploiting spatial diversity. Our results show that ORW reduces radio duty-cycles on average by 50% (up to 90% on individual nodes) and delays by 30% to 90% when compared to the state of the art

Self-organizing Routing Algorithm fo Wireless Sensors Networks (WSN) using Ant Colony Optimization (ACO) with Tinyos.

This paper describes the basic tools to work with wireless sensors. TinyOShas a componentbased architecture which enables rapid innovation and implementation while minimizing code size as required by the severe memory constraints inherent in sensor networks. TinyOS's component library includes network protocols, distributed services, sensor drivers, and data acquisition tools ? all of which can be used asia or be further refined for a custom application. TinyOS was originally developed as a research project at the University of California Berkeley, but has since grown to have an international community of developers and users. Some algorithms concerning packet routing are shown. Incar entertainment systems can be based on wireless sensors in order to obtain information from Internet, but routing protocols must be implemented in order to avoid bottleneck problems. Ant Colony algorithms are really useful in such cases, therefore they can be embedded into the sensors to perform such routing task

Development of a Robust Wireless Sensor Mesh and Multi-hop Network

Wireless networking has evolved rapidly since the first wireless device was invented. Throughout those years, researchers and engineers are struggling to apply the knowledge of wireless networking in useful ways in real life. Wireless Sensor Network (WSN) has been used in many applications, from habitat surveying to critical monitoring. Reliability of the WSN plays a major role in deciding whether it should be used or not in critical applications instead of using traditional wireless technology or wired networking. This project is solely a research and development of routing algorithm for WSN by using an existing source and straight away finding its weak point in order to apply further improvisation. The existing routing algorithms used are the XMESH and Ad-Hoc On-Demand Vector Routing (AODV)

Wireless sensors networks

After studying in depth look at wireless sensor networks are quite clear improvement compared to traditional wireless networks due to several factors as are the durability of the lifetime of the batteries, allowing greater portability of sensor nodes and that can record more events to power stay longer in some places, the routing protocols networks sensors allow gain than in durability also gain in efficiency the avoidance of collisions between packets, which also ensures a lower number of unnecessary network traffic. Because of the great features of such networks are currently using sensor networks in many projects related to different fields such as: environment, health, military, construction and structures, automotive, home automation, agriculture, etc. This type of network currently is leading a technological revolution similar to that had appearance of internet, because the applications appear to be infinite, also speaks global surveillance network on the planet capable of recording and tracking people specific goods and research projects have generated great interest for application in practice

A self-organizing routing algorithm for wireless sensor networks

Wireless sensor networks (WSN) are designed to collect and process sensory data from environments. Some environments are dangerous or un-reachable to human beings and it is difficult to replace sensor nodes when they are out of battery or even destroyed, i.e. wireless sensor nodes are in general prone to failure. This kind of characteristics require WSN to detect whether or not its next destination is still available (alive) and to maintain a transferring path if the next destination in the route does not exist (dead). In the normal state, nodes are in power-saving 'sleep' state. When a route is created for some purpose, all nodes in this route will be active and be ready to respond requests from its neighbors. Our approach is to maintain the routing table up-to-date by sending message from a last node to its next node and judging whether the next node is alive according to the response. If problems happen, node will self-organize and try to maintain transferring

Let the Tree Bloom: Scalable Opportunistic Routing with ORPL

Routing in battery-operated wireless networks is challenging, posing a tradeoff between energy and latency. Previous work has shown that opportunistic routing can achieve low-latency data collection in duty-cycled networks. However, applications are now considered where nodes are not only periodic data sources, but rather addressable end points generating traffic with arbitrary patterns. We present ORPL, an opportunistic routing protocol that supports any-to-any, on-demand traffic. ORPL builds upon RPL, the standard protocol for low-power IPv6 networks. By combining RPL's tree-like topology with opportunistic routing, ORPL forwards data to any destination based on the mere knowledge of the nodes' sub-tree. We use bitmaps and Bloom filters to represent and propagate this information in a space-efficient way, making ORPL scale to large networks of addressable nodes. Our results in a 135-node testbed show that ORPL outperforms a number of state-of-the-art solutions including RPL and CTP, conciliating a sub-second latency and a sub-percent duty cycle. ORPL also increases robustness and scalability, addressing the whole network reliably through a 64-byte Bloom filter, where RPL needs kilobytes of routing tables for the same task

Practical implementation and performance analysis on security of sensor networks

A wireless sensor network (WSN) is a network made of thousands of sensing elements called as nodes with wireless capabilities. Their application is varied and diverse ranging from military to domestic and household. As the world of self-organizing sensor networks tip to the edge of maximum utilization, their wider deployment is adding pressure on the security front. Powerful laptops and workstations make it more challenging for small sensors. In addition, there are many security challenges in WSN, e.g- confidentiality, authentication, freshness, integrity etc. Contributions of this work are as follows: “Symmetric” security implementation: This thesis work designs a symmetric-key based security in sensor hardware in the Link layer of sensor network protocols. Link Layer security can protect a wireless network by denying access to the network itself before a user is successfully authenticated. This prevents attacks against the network infrastructure and protects the network from devastating attacks. “Public key” implementation in sensor hardware: Asymmetric key techniques are attractive for authentication data or session keys. Traditional schemes like RSA require considerable amounts of resources which in the past has limited their use. This thesis has implemented Elliptic Curve Cryptography (ECC) in Mica2 hardware, which is an approach to public-key cryptography based on the mathematics of elliptic curves. Quantitative overhead analysis: This thesis work analyzes the wireless communication overhead (No. of packets transmitted) vs the (transmit and receive) energy consumed in mJoules and memory storage overhead (bytes) for ECC as compared to the symmetric counterpart for the implemented WSN security protocols