Efficient Neighbor Discovery using Multi Packet Reception in Wireless Networks
Keywords:
Wireless Networks, Multi packet Reception, Ad Hoc Networks, Neighbor Discovery, Network Management, Randomized Algorithm.Abstract
Neighbor revelation is one of the initial phases in arranging and dealing with a wireless system. The majority of the current work however expects a single packet reception (SPR) single packet can be gotten effectively at recipient. In this paper, roused by the expanding pervasiveness of multi packet reception (MPR) advances in wireless systems for example CDMA (code division multiple access) and MIMO (multiple input and multiple-output), two broadly utilized advances, both help multi packet gathering. Beginning with a faction of n nodes, we proposed an Aloha-like model, which takes (Θ= n l n/k) time to find neighbors with high likelihood in a system that permits up to k concurrent transmissions. Likewise, when Δ is huge, we demonstrate that the versatile algorithms are arranging ideal, i.e., have the running time of O (Δk) which coordinates the lower destined for the issue.
References
- Goeckel.D, Khalili.R ,Towsley.D, A. Swami. Neighbor discovery with reception status feedback to transmitters. Proc. of IEEE INFOCOM, March 2010
- Hannikainen.M, Kohvakka.M, Kuorilehto.M, Kaseva, T. D. Hamalainen. Energy-efficient neighbor discovery protocol for mobile wireless sensor networks. Ad Hoc Networks, 7, January2009
- Keshavarzian.A,.V, Herrmann.F, Manjeshwar.A, Uysal-Biyikoglu .D Energy-efficient link assessment in wireless sensor networks. Proc. of IEEE INFOCOM, March 2004.
- S Bitan, T. Etzion, “Constructions for optimal constant weight cyclically permutable codes and difference families,” IEEE Trans. Inf. Theory, vol. 4, no. 1, pp. 77–87, Jan. 1995.
- S Boyd, L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge University Press, 2004.
- F R. K. Chung, J. A. Salehi, V. K. Wei, “Optical orthogonal codes: Design, analysis, and applications,” IEEE Trans. Inf. Theory, vol. 35, no. 595–604, May 1989.
- Lin.D.D, Lim.T.J Subspace-based active user identification for collision-free slotted ad hoc network. IEEE Transactions on Communications,52(4):612–621, April 2004.
- Rus.D, Li.Q, “Sending messages to mobile users in disconnected ad-hoc wireless networks,”Proc. of ACM MobiCom, August, 2000.
- G G. H. Hardy, E. M. Wright, An Introduction to the Theory of Numbers. Oxford, U.K.: Oxford Univ. Press, 1979.
- J.-R. Jiang, Y.-C. Tseng, C.-S. Hsu, T.-H. Lai, “Quorum-based asynchronous power-saving protocols for IEEE 802.11 ad hoc networks,” Mobile Netw. Appl., vol. 10, 1–2, pp. 169–181, 2005.
- A. Kandhalu, K. Lakshmanan, R. Rajkumar, “U-connect: A low- latency energy-efficient asynchronous neighbor discovery protocol,” Proc. IPSN, 2010, pp. 350–361.
- Angelosante.D, Biglieri.E, Lops.M, Neighbor discovery in wireless networks: a multiuser-detection approach. Information Theory and Applications Workshop, pages 46–53, February 2007.
- Adler.M, Goeckel.D, Vasudevan.S, Towsley.D, Efficient algorithms for neighbor discovery in wireless networks. IEEE/ACMTransactions on Networking, 21(1):69–83, 2013
- Borbash.S.A, Ephremides.A, McGlynn.M.J.An asynchronous neighbor discovery algorithm for wireless sensor networks. Ad Hoc Networks, 5998–1016, 2007.
- Balakrishnan.H, Chandrakasan.A.P, Heinzelman.W.B Application-specific protocol architecture for wireless micro sensor networks and IEEE Trans. Wireless Communications, 1(4), October 2002.
- Cohen.B, Kapchits.R, Continuous neighbor discovery in asynchronous sensor networks. IEEE/ACM Trans. Networking, 19(1):69 –79, February 2011.
Downloads
Published
Issue
Section
License
Copyright (c) IJSRCSEIT
This work is licensed under a Creative Commons Attribution 4.0 International License.