Abstract
In any real time communication the selected protocol has a major role in determining QoS provision. This paper illustrates the working of a protocol which provides real time provision by discovery of multiple paths. The algorithm manages the dynamic changes by computation of alternate routes. Priority of data determines its share of bandwidth. The performance is assessed with different node distributions and scenarios. The protocol resolves congestion, contention, and static route switching limitation. The other advantages include, but not limited to better delivery times, less requirement of bandwidth, and better throughput.
Publisher
European Alliance for Innovation n.o.
Reference40 articles.
1. [1] Potter, G.J (1998) “Wireless Sensor Networks” in Proceedings of Information Theory Workshop, Killarney. pp 139 – 140, DOI: 10.1002
2. [2] Saunders, S. And Aragon-Zavala (2007), “A. Antennas and propagation for wireless communication systems”, 2nd ed., Wiley publishers, UK, ISBN: 978-0-470-84879-1.
3. [3] Frodigh, M. (2000) “Wireless Ad-hoc Networking-The art of Networking without a Net- work”, vol.4, Ericsson Review, pp.248-293.
4. [4] Lee,W.C. (1995) “Routing Subject to Quality of Service Constraints in Integrated Communication Networks”, IEEE Network, vol. 9,no.4,pp.46–55,DOI: 10.1109/65.397043.
5. [5] Lu, C.(2002) “RAP: A Real-time Communication Architecture for Large-Scale Wireless Sensor Networks:” in Proceedings of 8th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS’ 02), San Jose, CA, USA, pp.55-66, DOI: 10.1109/RTTAS.2002.1137381.