Smallest Latest Time First Spatial Channel Reuse Scheme for Corman

SMALLEST LATEST TIME FIRST SPATIAL CHANNEL REUSE SCHEME FOR CORMAN
Ms. J.Chitralega,
M.E- CSE, Nandha College of Technology, Erode. [e-mail] Mr. Dr.S.ArumugamB.E.,M.Sc(Engg).,Ph.D.,
Principal,Nandha College of Technology, Erode [e-mail] Abstract- Spatial Reuse Protocol behaves quite like the Point-to-Point Protocol (PPP) does in a Packet Over SONET (POS) environment. PPP acts as an abstraction layer between a higher level layer 2 technologies such as POS and a layer 1 technology such as SONET/SDH. Layer 1 and high level layer 2 protocols cannot interact directly without having an intermediate low level layer 2 protocol, in the case of DPT the layer 2 protocol is SRP.

Existing work presented Cooperative Opportunistic Routing in MANET (CORMAN) where the nodes use lightweight proactive source routing to determine intermediate node lists for data route (to destination). Data broadcast from upstream node reach downstream nodes are en-routed to its destination by cooperative communication at link and network layers. Nodes running CORMAN, forward data packets in fragments. This increased hop length between source and destination cause nodes at different segment of the route to operate simultaneously. This needs a pipeline of data transportation. Proposed work present Spatial Channel Reuse based Smallest Latest time First (SLF) technique to precise timing node back off. This is produce periodic updates transmitted to other nodes that processed in real-time to enable collaboration. Simulation was carried out with AODV for CORMAN with and without Spatial Channel Reuse based Smallest Latest time First (SLF) to analyze the performance improvement in terms of moderate and high channel utilization that includes collision probability rate.

Index terms: Spatial reuse, co-operative opportunistic routing. I. INTRODUCTION

Wireless channel have varied link qualities for data communication. Broad cast transmission are perceived

References: [1] S. Biswas and R. Morris, “ExOR: Opportunistic Multi-Hop Routing for Wireless Networks,” in Proc. ACM Conference of the Special Interest Group on Data Communication (SIGCOMM), Philadelphia, PA, USA, August 2005, pp. 133–144. [2] S. Chachulski, M. Jennings, S. Katti, and D. Katabi, “Trading Structure for Randomness in Wireless Opportunistic Routing,” in Proc. ACM Conference of the Special Interest Group on Data Communication (SIGCOMM), Kyoto, Japan, August 2007, pp. 169–180. [3] I. Chlamtac, M. Conti, and J.-N. Liu, “Mobile Ad hoc Networking: Imperatives and Challenges,” Ad Hoc Networks, vol. 1, no. 1, pp. 13– 64, July 2003. [4] C. Fragouli, J.-Y. L. Boudec, and J. Widmer, “Network Coding: an Instant Primer,” SIGCOMM Computer Communication Review, vol. 36, pp. 63–68, January 2006. [5] M. K. Marina and S. R. Das, “Routing Performance in the Presence of Unidirectional Links in Multihop Wireless Networks,” in The Third ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc’02), Lausanne, Switzerland, June 2002, pp. 12–23. [6] S. Murthy, “Routing in Packet-Switched Networks Using Path-Finding Algorithms,” Ph.D. dissertation, University of California - Santa Cruz, 1156 High Street, Santa Cruz, CA 95064, United States, 1996. [7] S. Murthy and J. J. Garcia-Luna-Aceves, “An Efficient Routing Protocol for Wireless Networks,” Mobile Networks and Applications, vol. 1, no. 2, pp. 183–197, October 1996. [8] R. Rajaraman, “Topology Control and Routing in Ad hoc Networks: A Survey,” SIGACT News, vol. 33, pp. 60–73, June 2002. [9] Z. Wang, C. Li, and Y. Chen, “PSR: Proactive Source Routing in Mobile Ad Hoc Networks,” in Proc. 2011 IEEE Conference on Global Telecommunications (GLOBECOM), Houston, TX USA, December 2011. [10] S. Yang, F. Zhong, C. K. Yeo, B. S. Lee, and J. Boleng, “Position Based Opportunistic Routing for Robust Data Delivery in MANETs,” in Proc. 2009 IEEE Conference on Global Telecommunications (GLOBECOM), Honolulu, Hawaii, USA, December 2009, pp. 1325–1330.