This Article 
 Bibliographic References 
 Add to: 
Boundary Mapping and Boundary-State Routing (BSR) in Ad Hoc Networks
January 2008 (vol. 7 no. 1)
pp. 127-139
This paper presents a geographic routing protocol Boundary State Routing (BSR) which consists of two components.The first is an improved forwarding strategy, Greedy-BoundedCompass, which can forward packets around concave boundarieswhere the packet moves away from the destination without looping. The second component is a Boundary Mapping Protocol(BMP) which is used to maintain link state information for boundaries containing concave vertices. The proposed forwardingstrategy Greedy-BoundedCompass is shown to produce a higher rate of path completion than Greedy forwarding andsignificantly improves the performance of GPSR in sparse networks when used in place of Greedy forwarding. The proposedgeographic routing protocol BSR is shown to produce significant improvements in performance in comparison to GPSR insparse networks due to informed decisions regarding direction of boundary traversal at local minima.

[1] C.E. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” Proc. ACM Conf. Comm. Architecture, Protocols and Applications (SIGCOMM '94), pp. 234-244, 1994.
[2] S. Murthy and J.J. Garcia-Luna-Aceves, “An Efficient Routing Protocol for Wireless Networks,” ACM Mobile Networks and Applications J., special issue on routing in mobile communication networks, vol. 1, pp. 183-197, Oct. 1996.
[3] T.-W. Chen and M. Gerla, “Global State Routing: A New Routing Scheme for Ad Hoc Wireless Networks,” Proc. IEEE Int'l Conf. Comm. (ICC '98), pp. 171-175, 1998.
[4] G. Chen, M. Gerla, and T.-W. Chen, “Fisheye State Routing: A Routing Scheme for Ad Hoc Wireless Networks,” Proc. IEEE Conf. Comm. (ICC '00), pp. 70-74, 2000.
[5] M.S. Corson and A. Ephremides, “A Distributed Routing Algorithm for Mobile Wireless Networks,” ACM/Balzer Wireless Networks, vol. 1, pp. 61-81, 1995.
[6] D.B. Johnson and D.A. Maltz, “Dynamic Source Routing in AdHoc Wireless Networks,” Mobile Computing, T. Imielinsky and H. Korth, eds., pp. 153-181, Kluwer Academic Publishers, 1996.
[7] C.-K. Toh, “A Novel Distributed Routing Protocol to Support Ad-Hoc Mobile Computing,” Proc. 15th IEEE Ann. Int'l Phoenix Conf. Computers and Comm. (IPCCC), pp. 480-486, Mar. 1996.
[8] R. Dube, C.D. Rais, K.-Y. Wang, and S.K. Tripathi, “Signal Stability Based Adaptive Routing (SSA) for Ad Hoc Mobile Networks,” IEEE Personal Comm., pp. 36-45, Feb. 1997.
[9] V.D. Park and M.S. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,” Proc. IEEE INFOCOM, 1997.
[10] C.E. Perkins and E.M. Royer, “Ad Hoc On-Demand Distance Vector Routing,” Proc. Second IEEE Workshop Mobile Computing Systems and Applications (WMCSA '99), pp. 90-100, 1999.
[11] Z.J. Hass, “A New Routing Protocol for Reconfigurable Wireless Networks,” Proc. Sixth IEEE Int'l Conf. Universal Personal Comm. (ICUPC '97), 1997.
[12] C.-C. Chiang, H.K. Wu, W. Liu, and M. Gerla, “Routing in Clustered Multihop, Mobile Wireless Networks with Fading Channel,” Proc. Fifth IEEE Singapore Int'l Conf. Networks (SICON '97), pp. 197-211, 1997.
[13] R. Sivakumar, P. Sinha, and V. Bharghavan, “CEDAR: A Core-Extraction Distributed Ad Hoc Routing Algorithm,” IEEE J. Selected Areas in Comm., vol. 17, pp. 1454-1465, Aug. 1999.
[14] G. Pei, M. Gerla, X. Hong, and C.-C. Chiang, “A Wireless Hierarchical Routing Protocol with Group Mobility,” Proc. Second ACM/IEEE Int'l Workshop Modeling Analysis and Simulation of Wireless and Mobile Systems (MSWiM '99), pp. 53-60, 1999.
[15] J.C. Navas and T. Imielinski, “GeoCast—Geographic Addressing and Routing,” Proc. ACM MobiCom, pp. 66-76, 1997.
[16] T. Imielinski and J.C. Navas, GPS-Based Addressing and Routing, IETF RFC 2009, Dept. of Computer Science, Rutgers Univ., 1996.
[17] T. Camp, Location Information Services in Mobile Ad Hoc Networks. Colorado School of Mines, Oct. 2003.
[18] R. Nelson and L. Kleinrock, “The Spatial Capacity of a Slotted ALOHA Multihop Packet Radio Network with Capture,” IEEE Trans. Comm., vol. 3, pp. 684-694, June 1984.
[19] H. Takagi and L. Kleinrock, “Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals,” IEEE Trans. Comm., vol. 32, pp. 246-257, Mar. 1984.
[20] T.-C. Hou and V.O.K. Li, “Transmission Range Control in Multihop Packet Radio Networks,” IEEE Trans. Comm., vol. 34, pp. 38-44, Jan. 1986.
[21] G. Finn, “Routing and Addressing Problems in Large Metropolitan-Scale Internetworks,” Technical Report ISI/RR-87-180, ISI, 1987.
[22] E. Kranakis, H. Singh, and J. Urrutia, “Compass Routing on Geometric Networks,” Proc. 11th Canadian Conf. Computational Geometry (CCCG '99), 1999.
[23] I. Stojmenovic, M. Russell, and B. Vukojevic, “Depth First Search and Location Based Localized Routing and QoS Routing in Wireless Networks,” Proc. 29th IEEE Int'l Conf. Parallel Processing (ICPP '00), pp. 173-180, 2000.
[24] M. Grossglauser and M. Vetterli, “Locating Nodes with EASE: Mobility Diffusion of Last Encounters in Ad Hoc Networks,” Proc. IEEE INFOCOM, 2003.
[25] I. Stojmenovic and X. Lin, “Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 12, pp. 1023-1032, Oct. 2001.
[26] S. Datta, I. Stojmenovic, and J. Wu, “Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks,” Proc. 21st IEEE ICDCS Workshop Wireless Networks and Mobile Computing (WNMC '01), 2001.
[27] B. Karp and H.T. Kung, “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks,” Proc. ACM MobiCom, pp. 243-254, 2000.
[28] F. Kuhn, R. Wattenhofer, and A. Zollinger, “Asymptotically Optimal Geometric Mobile Ad-Hoc Routing,” Proc. Sixth Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIALM '02), pp. 24-33, 2002.
[29] R. Jain, A. Puri, and R. Sengupta, “Geographical Routing Using Partial Information in Wireless Ad Hoc Networks,” IEEE Personal Comm., pp. 48-57, Feb. 2001.
[30] L. Blazevic, L. Buttyan, S. Capkun, S. Giordano, J.P. Hubaux, and J.-Y.L. Boudec, “Self-Organization in Mobile Ad-Hoc Networks: The Approach of Terminodes,” IEEE Comm. Magazine, June 2001.
[31] S.-C. Woo and S. Singh, “Scalable Routing Protocol for Ad Hoc Networks,” ACM Wireless Networks, vol. 7, pp. 513-529, 2001.
[32] Y.B. Ko and N.H. Vaidya, “Location-Aided Routing (LAR) in Mobile Ad Hoc Networks,” Proc. ACM MobiCom, pp. 66-75, 1998.
[33] S. Basagni, I. Chlamtac, V.R. Syrotiuk, and B.A. Woodward, “A Distance Routing Effect Algorithm for Mobility (DREAM),” Proc. ACM MobiCom, pp. 76-84, Oct. 1998.
[34] P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, “Routing with Guaranteed Delivery in Ad Hoc Wireless Networks,” Proc. Third ACM Int'l Workshop Discrete Algorithms for Mobile Computing and Comm. (DIALM '99), pp. 48-55, 1999.
[35] L. Blazevic, S. Giordano, and J.-Y.L. Boudec, “A Location-Based Routing Method for Mobile Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 4, pp. 97-110, Mar./Apr. 2005.
[36] M. Heissenbüttel and T. Braun, “A Novel Position-Based and Beacon-Less Routing Algorithm for Mobile Ad-Hoc Networks,” Proc. Third IEEE Workshop Applications and Services in Wireless Networks (ASWN' 03), pp. 197-209, 2003.
[37] B. Karp, Geographic Routing for Wireless Networks. Harvard Univ., 2000.

Index Terms:
Algorithm, packet switching, networks, network routing, wireless lan
Colin J. Lemmon, Phillip Musumeci, "Boundary Mapping and Boundary-State Routing (BSR) in Ad Hoc Networks," IEEE Transactions on Mobile Computing, vol. 7, no. 1, pp. 127-139, Jan. 2008, doi:10.1109/TMC.2007.70722
Usage of this product signifies your acceptance of the Terms of Use.