Open Access Open Access  Restricted Access Subscription or Fee Access

Improvement of Quality of Service in Time Sensitive Wireless Sensor Networks

S.R. Boselin Prabhu, A. Thirunavukarasu, S. Kaliappan


Wireless sensor Networks (WSNs), is one of the most rapidly growing scientific domain. This is because of the development of advanced sensor nodes with extremely low cost One of the characteristic feature of WSNs compared to the traditional wireless communication networks, is the power awareness, due to the fact that the batteries of the sensor nodes have restricted lifetime and are difficult to be replaced. This is why we focus on “power awareness”. Due to its working environment and the mobility of sensor node, this kind of sensor network is very much essential to reduce power utility. We propose a jumping ant routing algorithm (JARA) which combines the advantages of reactive and proactive routing to speed up the route discovery time and reduce the route discovery overhead in sensor network, thereby reducing power. The simulation results shows improvement in energy efficiency depends on number of source nodes in sensor network which is 45% energy efficiency using optimal aggregation compared to approximate aggregation schemes in moderate number of sources. To reduce “delay” in such networks we introduce replication or “spraying” methods that can reduce the overhead of flooding-based schemes by distributing a small number of copies to only a few relays, whereas 20% energy efficiency in large number of source nodes. To route messages efficiently in such networks, we propose a scheme that also distributes a small number of copies to few relays. However, each relay can then forward its copy, instead of naively waiting to deliver it to the destination itself. This scheme exploits all the advantages of controlled replication, and could deliver the message faster thereby reducing delay. Simulation results for traditional mobility models, as well as for a more realistic “community-based” model, indicate that our scheme can reduce the delay 20 times compared to existing techniques. Hence the Quality of Service (QoS) is greatly improved when comparing with the existing techniques.


Wireless Sensor Networks, JARA (Jumping Ant Routing Algorithm), Spray and Focus Routing, Quality of Service (QoS)

Full Text:



B. Krishanamachari, D. Estrin and S. Wicker, “The Impact of Aggregation in Wireless Sensor Networks”, International Workshop of Distributed Event Based Systems (DEBS), Vienna, Austria, 2002.

C. Intanagonwiwat, D. Estrin, R. Govindan, and J. Heidemann, “Impact of Network Density on Data Aggregation in Wireless Networks”, California, November, 2001.

Utz Roedig, Andre Barroso, and Cormac J. Sreenan. “Determination of Aggregation Points in Wireless Sensor Networks”, pp. 503–510, IEEE Computer Society Press, August 2004.

S. Das, G. Singh, S. Gosavi, S. Pujar, “Ant Colony Algorithms Data-Centric Routing in Sensor Networks”, Joint Conference on Information Sciences, North Carolina, 2003.

Al-Karaki, J. N., R. Ul-Mustafa and A. E. Kamal, "Data Aggregation in Wireless Sensor Networks -Algorithms", International Workshop on High-Performance Switching and Routing, Phoenix, AZ, April 2004.

R.Cristescu,B.Beferull-Lozano, and M.Vetterli, “On network correlated data gathering”, Infocom‟04,Hong Kong,2004.

Y.P.Tak-Shing, “Optimal Routing for Maximizing Lifetime of Wireless Sensor Networks”, Infocom‟05, 2005.

O. Hussein, T. Saadawi, “Ant routing algorithm for mobile ad-hoc networks (ARAMA)”, Performance, computing, and communications conference, 2003. IEEE International, 9–11, 2003, pp. 281–290.

B. Chen, K. Jamieson, H. Balakrishnan, R. Morris, “Span: an energy efficient coordination algorithm”, 7th Annual Conf. on Mobile Computing and Networking, 2001.

W. Heinzelman, J. Kulik, H. Balakrishnan, “Negotiation-based protocols for disseminating information in wireless sensor networks”, Proceedings of the 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking, 1999.

S. Lindsey, C. Raghavendra, “PEGASIS: power-efficient gathering in sensor information systems”, International Conf. on Communications, 2001.

C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann, F. Silva, “Directed diffusion for wireless sensor networking”, IEEE/ACM Transactions on Networking 11 (2003) 2–16.

D. Braginsky, D. Estrin, “Rumorrouting algorithm for sensor networks, in: Proc. of the 1st ACM International Workshop on Wireless Sensor Networks and Applications, Atlanta, Georgia, USA, 2002.

M.T. Islam, P. Thulasiraman, R.K. Thulasiram, “A parallel ant colony optimization algorithm for all-pair routing in MANETs”, Parallel and Distributed Processing Symposium, 2003. Proceedings International, 2003, pp. 22–26.

M. Gunes, U. Sorges, I. Bouazizi, “ARA-the ant-colony based routing algorithm for MANETs”, Parallel Processing Workshops, 2002. Proceedings International Conference on, 18–21, 2002, pp. 79–85.

Kwang Mong Sim, Weng Hong Sun, “Ant colony optimization for routing and load-balancing: survey and new directions”, Systems, Man and Cybernetics, Part A, IEEE Transactions on, 33 (5) (2003) 560–572.

T. Spyropoulos, K. Psounis, and C. S. Raghavendra, “Spray and wait: Efficient routing in intermittently connected mobile networks”, Proceedings of ACMSIGCOMM workshop on Delay Tolerant Networking (WDTN), 2005.

T. Spyropoulos, K. Psounis, and C. S. Raghavendra. “Performance analysis of mobility-assisted routing”, Proceedings of ACM/IEEE MOBIHOC, 2006.

T. Spyropoulos, K. Psounis, and C. S. Raghavendra, “Efficient routing in intermittently connected mobile networks”, multiple-copy case appeared in Transactions on Networking, 2007.

S. Jain, K. Fall, and R. Patra, “Routing in a delay tolerant Network”, Proceedings of ACM SIGCOMM, Aug. 2004.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.