Congestion-Aware Opportunistic Routing Protocol in Wireless Sensor Networks

It is expected that 50 billion devices in the world will be connected on IOT by 2025. The importance of wireless sensor networks cannot be overstated in this scenario. Network becomes more beneficial to an application when it can be used to its full potential, which is difficult to achieve because of limitations of resources (processor, memory, and energy). There are many existing routing mechanisms which deal with these issues by reducing number of transmissions between sensor nodes by choosing appropriate path toward base station. In this paper, we propose a routing protocol to select the optimized route by using opportunistic theory and by incorporating appropriate sleep scheduling mechanisms into it. This protocol focuses on reduction of congestion in the network and thus increases an individual node’s life, the entire network lifetime, and reduces partitioning in the network.

[1]  Arkady B. Zaslavsky,et al.  Context Aware Computing for The Internet of Things: A Survey , 2013, IEEE Communications Surveys & Tutorials.

[2]  Di Wu,et al.  Opportunistic Routing Algorithm for Relay Node Selection in Wireless Sensor Networks , 2015, IEEE Transactions on Industrial Informatics.

[3]  Athanasios V. Vasilakos,et al.  EDAL: An Energy-Efficient, Delay-Aware, and Lifetime-Balancing Data Collection Protocol for Heterogeneous Wireless Sensor Networks , 2015, IEEE/ACM Transactions on Networking.

[4]  Bo Li,et al.  Upstream congestion control in wireless sensor networks through cross-layer optimization , 2007, IEEE Journal on Selected Areas in Communications.

[5]  Haitao Liu,et al.  Opportunistic routing for wireless ad hoc and sensor networks: Present and future directions , 2009, IEEE Communications Magazine.

[6]  Wang Wei,et al.  Energy-efficient and low-delay scheduling scheme for low power wireless sensor network with real-time data flows , 2016, UbiComp 2016.

[7]  Robert Tappan Morris,et al.  ExOR: opportunistic multi-hop routing for wireless networks , 2005, SIGCOMM '05.

[8]  Yunhao Liu,et al.  Duplicate Detectable Opportunistic Forwarding in Duty-Cycled Wireless Sensor Networks , 2016, IEEE/ACM Transactions on Networking.

[9]  Akshay Malhotra,et al.  Fuzzy-based fault-tolerant low-energy adaptive clustering hierarchy routing protocol for wireless sensor network , 2016, Int. J. Wirel. Mob. Comput..

[10]  Kamaljit Singh Saini,et al.  A survey on recent congestion control schemes in wireless sensor network , 2015, 2015 IEEE International Advance Computing Conference (IACC).

[11]  JAMAL N. AL-KARAKI,et al.  Routing techniques in wireless sensor networks: a survey , 2004, IEEE Wireless Communications.

[12]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[13]  K. R. R. Mohan Rao,et al.  Improving the Network Life Time of a Wireless Sensor Network using the Integration of Progressive Sleep Scheduling Algorithm with Opportunistic Routing Protocol , 2016 .

[14]  Shaojie Tang,et al.  Energy-Efficient Opportunistic Routing in Wireless Sensor Networks , 2011, IEEE Transactions on Parallel and Distributed Systems.

[15]  Marimuthu Palaniswami,et al.  Internet of Things (IoT): A vision, architectural elements, and future directions , 2012, Future Gener. Comput. Syst..

[16]  Dhananjay Singh,et al.  A survey of Internet-of-Things: Future vision, architecture, challenges and services , 2014, 2014 IEEE World Forum on Internet of Things (WF-IoT).

[17]  Sachin Katti,et al.  Trading structure for randomness in wireless opportunistic routing , 2007, SIGCOMM 2007.

[18]  Gregory D. Abowd,et al.  A Conceptual Framework and a Toolkit for Supporting the Rapid Prototyping of Context-Aware Applications , 2001, Hum. Comput. Interact..

[19]  Michele Zorzi,et al.  Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Energy and Latency Performance , 2003, IEEE Trans. Mob. Comput..

[20]  Yashwant Singh,et al.  An Energy Efficient Opportunistic Routing Metric for Wireless Sensor Networks , 2016 .