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

Gnanasekar, J.M

Rajesh, First M.

English

International Institute for Science, Technology and Education (IISTE): E-Journals

Network and Complex Systems                                                                                                                                                         www.iiste.org ISSN 2224-610X (Paper) ISSN 2225-0603 (Online) Vol.5, No.7, 2015  1 Sector Routing Protocol (SRP) in Ad-hoc Networks  First M.Rajesh 1,       Second J.M Gnanasekar 2 1, Research Scholar, Department of Computer Science & Engineering, St.Peter's University Chennai, 2. Professor, Dept. of Computer Science and Engineering, Sri Venkateswara College Of Engineering, India  Abstract 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. INTRODUCTION Ad-hoc networks are wireless networks that have no fixed infrastructure. They are characterized by dynamic topology with no fixed routers. These networks are gaining popularity within the computing industry for their attractive features and applications. Many more applications exist already or are imaginable in the near future as it is expected that ad-hoc networking will be more intensively used for different applications such as digital battlefield communications, movable base-stations, and range extension for cellular telephone [4].One of the most demanding and challenging aspects of ad-hoc networks is the routing issue. Routing can be defined as the process of finding a path from the source to the destination to deliver packets to the destination nodes while the nodes in the network are moving freely [4].Secure routing is also a vital factor for mobile ad-hoc networks because of the sensitive applications of these networks. However, achieving security goals, such as confidentiality, authentication, integrity, availability, and access control in these networks is a challenging task. In general, a mobile ad-hoc network is particularly vulnerable to attacks due to its fundamental characteristics of open medium, dynamic topology, distributed cooperation, constrained capability, and absence of central authorities [5].  2. ROUTING IN AD-HOC NETWORKS Routing in ad-hoc networks is the process of selecting paths in a network by which a packet travels from a source to a destination. The nodes which are in the transmission range of each other communicate directly otherwise communication is done through intermediate nodes. Thus each node may act as router or as host. Depending on how node establish and maintain route to the destination, protocols can be classified into three categories: proactive (table-driven), reactive (demand driven), hybrid routing protocols.  2.1 Proactive Routing Proactive approach is a table driven protocol where each node maintains consistent up-to-date information to every other node in the network by maintaining routing table(s). Therefore arouting path is known and is immediately available to the source node if it needs one. Using a proactive routing protocol nodes continuously calculate routes to all nodes that are reachable and thus maintains a consistent view of topology. Some of the proactive routing protocols are: • DSDV • WRP • OLSR • FSR Proactive protocols have the advantage of minimum initial delay but causes significant signaling traffic and power consumption problem. These protocols results in a large overhead due to the route maintenance and frequent route updates.  2.2 Reactive Routing Reactive routing protocols are on-demand protocols where routing information is acquired only where it is needed. In reactive routing, a route determination process is invoked on demand when a node request for a route. The reactive routing protocols do not maintain the information about the routes; rather routes are maintained only during the communication or for some period of time. Some of the reactive routing protocols are: • AODV • DSR Network and Complex Systems                                                                                                                                                         www.iiste.org ISSN 2224-610X (Paper) ISSN 2225-0603 (Online) Vol.5, No.7, 2015  2 Reactive routing adds latency to the network due to the route discovery mechanism. These protocols decrease the routing overhead but at the cost of increased latency.  2.3 Hybrid Routing Hybrid protocol combines the advantage if both proactive and reactive routing protocol. Hybrid protocol is presented to overcome the shortcomings of both Proactive and Reactive protocol. It uses the route discovery mechanism of proactive protocol. Some of the hybridrouting protocols are: • ZRP • SHRP  3. ZONE ROUTING PROTOCOL Zone routing protocol uses the hybrid approach for routing. It uses the advantages of both proactive and reactive protocol. ZRP [2] aims to address excess bandwidth and long routerequest delay of proactive and reactive routing protocols. ZRP divides the entire network into zones of variable size. Every node in the network has a zone associated to it. The size of azone is not determined by geographical measurement but is given by a radius of length ρ,where ρ is the number of hops to the perimeter of the zone. ZRP is not a very distinct protocol; it provides a framework for other protocols [1].  4. ZRP ARCHITECTURE In zone routing protocol, a routing zone is defined for each node separately and the zones of neighboring nodes overlap [2]. The routing zone has a radius ρ expressed in hops. The zone thus includes the nodes, where distance from center node is at most ρ hops. A routing zone with radius two can be seen in figure 1, where the routing zone of S includes nodes A-K but not L  4.1 Intra Zone Routing Protocol (IARP) IARP is used by a node to communicate with the interior nodes of its zone and is limited bythe zone radius [6]. It maintains routes inside the zone, each node continuously needs to update the routing information in order t determine the peripheral nodes as well as maintain amap of which nodes can be reached locally.  4.2 Inter Zone Routing Protocol (IERP) IERP is used to communicate between nodes of different zones. It is reactive routing component which offers enhanced route discovery [7]. The IERP needs to be able to take advantage of the local connectivity provided by IARP. Route discovery is done through a process called border casting that uses a Border cast Routing Protocol (BRP) to only transmit route requests to peripheral nodes.  4.3 Bordercast Routing Protocol (BRP) BRP is used to direct the route requests initiated by the IERP to the peripheral nodes and also utilizes the topology information provided by IARP to construct a border cast tree. For route requests away from areas of network, a query control mechanism is employed by BRP. [8]  5. ROUTING IN ZRP In the route discovery mechanism the source initiates the route discovery, it first checks whether the destination is inside or outside the zone [9]. If the destination node is within the zone, the packet is routed using proactive approach and if the destination node is outside the zone, reactive routing is used. Reactive approach for routing the packet to the destination outside the zone includes two phases: route discovery phase and route reply phase. In route discovery phase, usingBordercast Resolution Protocol (BRP), the source node sends a RREQ (route request) packet to its peripheral nodes. If the node receiving the RREQ packet knows the destination send s aroute reply to the source, otherwise the process continues by border casting the packet. A node that can provide a route to the destination node sends a route reply to the source node.   6. QUERY CONTROL MECHANISMS Border casting can be more efficient than flooding, since route request packets are only sent tothe peripheral nodes and thus only on the corresponding links. However, each node mayforward route requests several times due to overlapping zones which results in more traffic than in flooding. The excess traffic is a result from queries returning to covered nodes as in traditional flooding [2]. ZRP uses query control mechanisms, query detection, early termination and random query processing delay to solve this problem. In query detection  mechanism, it is possible to detect queries relayed by other nodes in the same zone to prevent them from reappearing in the covered zone. Also, a node can prevent route request from entering already covered regions by using early termination. The information obtained through query detection combined with the knowledge of the local Network and Complex Systems                                                                                                                                                         www.iiste.org ISSN 2224-610X (Paper) ISSN 2225-0603 (Online) Vol.5, No.7, 2015  3 topology can be used to prune border casting to peripheral nodes inside covered regions. Finally, a random query processing delay can be employed to reduce the probability of receiving the same request from several nodes. Each broadcasting node waits a random time before the construction of the border cast tree and the early termination. During this time the waiting node can detect queries from other border casting nodes and prune the border cast tree[9].  7. CONCLUSION Zone routing protocol is targeted for large networks that combines the proactive and reactive approach in one protocol. Inside the routing zone, proactive component IARP maintains the routing tables. Outside the zone, route discovery mechanism is done by reactive component IERP using route requests and route replies. A border casting process is used for out discovery using Border casting Resolution Protocol (BRP). To reduce the amount of query traffic, query control mechanisms query detection and early termination can be used. ZRP rather than a distinct protocol, can be taken as routing framework  REFERENCES [1] Aram, C. Singh, S. and A. Kumar, (2009) “Cooperative Profit Sharing in Coalition Based Resource Allocation in Wireless Networks”, Proc IEEE INFOCOM. [2] S.Bansal and M.Barker, “Observation based cooperation enforcement in Ad-Hoc networks”, Arxiv preprint cs/0307012, 2003 [3] K. Liu, J. Deng, P.K. Varshney, and K. Balakrishnan, “An Acknowledgment-Based Approach for the Detection of Routing Misbehavior in MANETs,” IEEE Trans. Mobile Computing, vol. 6, May 2007.  [4] L.Anderegg and S.Eldenbenz, (2003) “AdHoc VCG: A truthful and cost efficient routing protocol for mobile adhoc Networks”, Proc ACM MobiCom  [5] S.Zhong, J.Cheng and Y.R.Yang ,”Sprite:A simple chat proof credit based system for mobile adhoc networks”, Proc IEEE INFOCOM, 2003.  [6] P.Dewan, P.Dasgupta and A.Bhattacharya , “On using reputations in adhoc networks to counter malicious nodes”, Proc. Int’l Conf.Parrallel and distributed systems (ICPADS), 2004  [7] M.T. Refaei, L.A. , M. Eltoweissy and T. Nadeem, (2010) “Adaption of Reputation Management Systems to Dynamic z Conditions in Ad Hoc Networks”, IEEE Trans.  [8] P.Michrardi and R.Molva, (2004) “CORE: A collaborative reputation mechanism to enforce node cooperation in Mobile adhoc networks”, Proc. [9] K.Liu, J.Deng, P.K. Varshney, K. Balakrishnan,“An Acknowledgment-Based proach for the Detection of Routing Misbehavior in MANETs,” IEEE Trans. Mobile Computing, 2007.  [9] Z. Li and H. Shen, (2011) “A Hierarchical Account-Aided Reputation Management System for Large-Scale MANETs”, Proc IEEE INFOCOM.  [10] Wei Yu, K.J. Ray Liu,“Game Theoretic Analysis of Cooperation Stimulation and Security in Autonomous Mobile Ad Hoc Networks”, 2007  [11] Ze Li and Haiying Shen “Game-Theoretic Analysis of Cooperation Incentive Strategies in Mobile Ad Hoc Networks”, IEEE TRANSACTIONS ON MOBILE COMPUTING.  [12] K.Balakrishnan, J.Deng and V.K.Varshney, (2005) “TWOACK:Preventing selfishness in Mobile adhoc networks”, Proc. IEEE Wireless Comm. And Networking Conf.(WCNC).  [13] Zhiqiang Shi, Ionescu, D., Dongli Zhang, “A Token Based Method for Congestion and Packet Loss Control “ Latin America Transactions, IEEE (Revista IEEE America Latina)  (Volume:11 ,  Issue: 2 ) March 2013. [14] D. Miorandi, E. Altman, and G. Alfano, “The impact of channel randomnesson coverage and connectivity of ad hoc and sensor networks, IEEE Trans. Wireless Commun., vol. 7, no. 3, pp. 1062–1072, Mar. 2008. [15] M. Haenggi, “A geometric interpretation of fading in wireless networks: theory and applications,” IEEE Trans. Inf. Theory, vol. 54, no. 12, pp.5500–5510, Dec. 2008. [16] F. Baccelli and B. Blaszczyszyn, “Stochastic geometry and wireless networks volume 2: applications,” Found. Trends Netw., vol. 4, no. 1-2,pp. 1–312, 2009. [17] V. Chandrasekhar and J. G. Andrews, “Uplink capacity and interference avoidance for two-tier femtocell networks,” IEEE Trans. Wireless Commun., vol. 8, no. 7, pp. 3498–3509, July 2009. [18] K. Huang, V. K. N. Lau, and Y. Chen, “Spectrum sharing between cellular and mobile ad hoc networks: transmission-capacity trade-off,” IEEE J. Sel. Areas Commun., vol. 27, no. 7, pp. 1256–1267, Sept. 2009. [19] P. C. Pinto, A. Giorgetti, M. Z. Win, and M. Chiani, “A stochastic geometry approach to coexistence in heterogeneous wireless networks,” IEEE J. Sel. Areas Commun., vol. 27, no. 7, pp. 1268–1282, Sept. 2009. A. Rabbachin, T. Q. S. Quek, H. Shin, and M. Z. Win, “Cognitive network interference,” IEEE J. Sel. Areas Commun., vol. 29, no. 2, pp. 480–493, Feb. 2011. [20] M. Haenggi, J. G. Andrews, F. Baccelli, O. Dousse, andM. Franceschetti, “Stochastic geometry and random graphs for the analysis and design of wireless networks,” IEEE J. Sel. Areas Commun., vol. 27, no. Network and Complex Systems                                                                                                                                                         www.iiste.org ISSN 2224-610X (Paper) ISSN 2225-0603 (Online) Vol.5, No.7, 2015  4 7, pp. 1029–1046, Sept. 2009. [21] S. Weber, J. G. Andrews, and N. Jindal, “An overview of the transmission capacity of wireless networks,” IEEE Trans. Commun., vol. 56,no. 12, pp. 3593–3604, Dec. 2010.   BIOGRAPHY  M.Rajesh, received the BE degree in computer Science and engineering from kamban engineering Tiruvannamalai, Tamilnadu in 2006 and the ME Degree in computer science and engineering from  Arunai college of engineering Tiruvannamalai, Tamilnadu, India in 2012. He pursuing Ph.D in computer Science and engineering from St.Peter’s university, Chennai, Tamilnadu, India. He is currently working as a Assistant Professor in computer science and engineering from KRS College Of Engineering, Vandavasi, Tamilnadu,India.  The IISTE is a pioneer in the Open-Access hosting service and academic event management.  The aim of the firm is Accelerating Global Knowledge Sharing.  More information about the firm can be found on the homepage:  http://www.iiste.org  CALL FOR JOURNAL PAPERS There are more than 30 peer-reviewed academic journals hosted under the hosting platform.   Prospective authors of journals can find the submission instruction on the following page: http://www.iiste.org/journals/  All the journals articles are available online to the readers all over the world without financial, legal, or technical barriers other than those inseparable from gaining access to the internet itself.  Paper version of the journals is also available upon request of readers and authors.   MORE RESOURCES Book publication information: http://www.iiste.org/book/ Academic conference: http://www.iiste.org/conference/upcoming-conferences-call-for-paper/   IISTE Knowledge Sharing Partners EBSCO, Index Copernicus, Ulrich's Periodicals Directory, JournalTOCS, PKP Open Archives Harvester, Bielefeld Academic Search Engine, Elektronische Zeitschriftenbibliothek EZB, Open J-Gate, OCLC WorldCat, Universe Digtial Library , NewJour, Google Scholar   

Sector Routing Protocol (SRP) in Ad-hoc Networks

https://www.iiste.org/Journals/index.php/NCS/article/download/24009/24579

Sector Routing Protocol (SRP) in Ad-hoc Networks

Abstract

Similar works

Full text

Available Versions

International Institute for Science, Technology and Education (IISTE): E-Journals