Sector Routing Protocol (SRP) in Ad-hoc Networks

Routing protocols for wireless ad-hoc networks face the challenge of dynamic topology due to node mobility, limited channel bandwidth and low transmission power. Both proactive and reactive protocols have trade-off in them. Proactive protocols have large overhead and less latency while reactive protocols have less overhead and more latency. The ZRP is a hybrid protocol that overcomes the shortcomings of both proactive and reactive routing protocol. ZRP divides the entire network into overlapping zones of variable size where routing inside the zone is performed using proactive approach and outside the zone is performed using reactive approach. Keywords: Ad-hoc Networks, Routing, Reactive, Proactive, ZRP.

[1]  Vincent K. N. Lau,et al.  Spectrum sharing between cellular and mobile ad hoc networks: transmission-capacity trade-off , 2008, IEEE Journal on Selected Areas in Communications.

[2]  Moe Z. Win,et al.  A stochastic geometry approach to coexistence in heterogeneous wireless networks , 2009, IEEE Journal on Selected Areas in Communications.

[3]  Haiying Shen,et al.  Game-Theoretic Analysis of Cooperation Incentive Strategies in Mobile Ad Hoc Networks , 2012, IEEE Transactions on Mobile Computing.

[4]  K. J. Ray Liu,et al.  Game Theoretic Analysis of Cooperation Stimulation and Security in Autonomous Mobile Ad Hoc Networks , 2007, IEEE Transactions on Mobile Computing.

[5]  Martin Haenggi A Geometric Interpretation of Fading in Wireless Networks: Theory and Applications , 2008, IEEE Transactions on Information Theory.

[6]  Mary Baker,et al.  Observation-based Cooperation Enforcement in Ad Hoc Networks , 2003, ArXiv.

[7]  Pramod K. Varshney,et al.  An Acknowledgment-Based Approach for the Detection of Routing Misbehavior in MANETs , 2007, IEEE Transactions on Mobile Computing.

[8]  Sheng Zhong,et al.  Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[9]  Pramod K. Varshney,et al.  TWOACK: preventing selfishness in mobile ad hoc networks , 2005, IEEE Wireless Communications and Networking Conference, 2005.

[10]  Refik Molva,et al.  Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks , 2002, Communications and Multimedia Security.

[11]  Hyundong Shin,et al.  Cognitive Network Interference , 2011, IEEE Journal on Selected Areas in Communications.

[12]  Stephan Eidenbenz,et al.  Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents , 2003, MobiCom '03.

[13]  Jeffrey G. Andrews,et al.  Uplink capacity and interference avoidance for two-tier femtocell networks , 2007, IEEE Transactions on Wireless Communications.

[14]  Haiying Shen,et al.  A hierarchical account-aided Reputation Management system for large-scale MANETs , 2011, 2011 Proceedings IEEE INFOCOM.

[15]  Jeffrey G. Andrews,et al.  Stochastic geometry and random graphs for the analysis and design of wireless networks , 2009, IEEE Journal on Selected Areas in Communications.

[16]  Partha Dasgupta,et al.  On using reputations in ad hoc networks to counter malicious nodes , 2004, Proceedings. Tenth International Conference on Parallel and Distributed Systems, 2004. ICPADS 2004..

[17]  Dongli Zhang,et al.  A Token Based Method for Congestion and Packet Loss Control , 2013, IEEE Latin America Transactions.

[18]  François Baccelli,et al.  Stochastic Geometry and Wireless Networks, Volume 2: Applications , 2009, Found. Trends Netw..

[19]  Luiz A. DaSilva,et al.  Adaptation of Reputation Management Systems to Dynamic Network Conditions in Ad Hoc Networks , 2010, IEEE Transactions on Computers.