Node Application and Time Based Fairness in Ad-Hoc Networks: An Integrated Approach

Conference paper
Part of the Smart Innovation, Systems and Technologies book series (SIST, volume 44)


In ad hoc networks, balancing overall delay among multiple flows with different priorities is a major challenge. Normally, packets having higher priority are scheduled to dispatch first than the packets having lower priority. However, priority is calculated by considering the weights of either application or region. As a result, flows with lower priority reach to the destination after a long delay or dropped because of starvation. So an efficient mechanism must be framed for achieving delay bounded service in heterogeneous applications of ad hoc network. In this paper, we propose an integrated priority measurement technique for minimize overall delay among multiple flows. The proposed model uses the elapsed time as a measure factor to calculate priority. The packets suffered a larger as well as less delay are assigned a lower priority as they are either less important at sink node or can be delayed to reach at destination within time bound. Performance evaluation of this protocol moderates the end to end latency to the flows having lower priority.


Ad hoc networks Fairness TCP WSNs Reliability 


  1. 1.
    Rathnayaka, A.J.D., Potdar, V.M.: Wireless sensor network transport protocol: a critical review. J. Netw. Comput. Appl. (2013)Google Scholar
  2. 2.
    Ganesh, P., Chockalingam, S.: A collection of open research problems in rate based transport protocols for multihop ad hoc wireless network. In: IEEE-International Conference on Advances in Engineering, Science and Management (2012)Google Scholar
  3. 3.
    Francisco, J., Chai, K., Cano, J., et al.: A survey and comparative study of simulators for vehicular ad hoc networks (VANETs). Wireless Commun. Mob. Comput. 11(7), 813–828 (2011)CrossRefGoogle Scholar
  4. 4.
    Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: a survey. IEEE Commun. Mag. (2002)Google Scholar
  5. 5.
    Liaojun, P., Huixian, L., Qingqi, P., Nengbin, L., Yumin, W.: Fair data collection scheme in wireless sensor networks. Commun. Soft. (2013)Google Scholar
  6. 6.
    Chen, Z., Yang, G., Chen, L., et al.: Data aggregation scheduling with guaranteed lifetime and efficient latency in wireless sensor networks. China Commun. 9(9), 11–21 (2012)Google Scholar
  7. 7.
    Hamid, M.A., Alam, M.M., Isiam, M., et al.: Enforcing fairness for data collection in wireless sensor networks. In: Proceedings of the 8th Annual Communication Networks and Services Research Conference, 11–14 May 2010, pp. 192-198. Montreal, QC, Canada, IEEE press (2010)Google Scholar
  8. 8.
    Hamid, M.A., Alam, M.M., Isiam, M., et al.: Fair data collection in wireless sensor networks. Anal. Protoc. Ann. Telecommun. 65(7), 433–446 (2010)CrossRefGoogle Scholar
  9. 9.
    Wakuda, K., Kasahara, S., Takahashi, Y., Kure, Y., Itakura, E.: A packet scheduling algorithm for max-min fairness in multihop wireless LANs. Comput. Commun. (2009)Google Scholar
  10. 10.
    Sridharan, A., Krishnamachari, B.: Maximizing network utilization with max-min fairness in wireless sensor networks. Wireless Netw. 15(5), 585–600 (2009)CrossRefGoogle Scholar
  11. 11.
    Gungor, V.C., Akan, O.B., Akyildiz, I.F.: A real-time and reliable transport (RT2) protocol for wireless sensor and actor networks. IEEE/ACM Trans. Netw. (2008)Google Scholar
  12. 12.
    Rangwala, S., Gummadi, R., Govindan, R., et al: Interference-aware fair rate control in wireless sensor networks. In: Proceedings of the ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 63–74 (2006)Google Scholar
  13. 13.
    Wang, C., Sohraby, K., Lawrence, V., Li, B., Hu, Y.: Priority-based congestion control in wireless sensor networks. In: Proceedings of the IEEE Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (2006)Google Scholar
  14. 14.
    Yuan, X., Duan, Z.: Fair round robin: a low complexity packet scheduler with proportional and worst-case fairness (2006)Google Scholar
  15. 15.
    Iyer, Y.G., Gandham, S., Venkatesan, S.: STCP: A generic transport layer protocol for wireless sensor networks. In: Proceedings of the 14th IEEE International Conference on Computer Communications and Networks (2005)Google Scholar
  16. 16.
    Ee, C.T., Bajcsy, R.: Congestion control and fairness for many-to-one routing in sensor networks. In: Proceedings of the 2nd International Conference on Embedded Networked Association for Computing Machinery Sensor Systems (2004)Google Scholar
  17. 17.
    Ramabhadran, S., Pasquale, J.: Stratified round robin: a low complexity packet scheduler with bandwidth fairness and bounded delay (2003)Google Scholar
  18. 18.
    Monowar, M., Rahman, O., Pathan, A.K., Hong, C.S.: Prioritized heterogeneous traffic-oriented congestion control protocol for WSNs. Int. Arab J. Inf. Technol. (2012)Google Scholar
  19. 19.
    Mishra, T.K., Tripathi, S.: Fair and reliable transmission control protocol for ad hoc networks. In: International Conference on Advances in Computing and Communications (2014)Google Scholar
  20. 20.
    NS-2., NS-2.35. Accessed 4 Nov 2011

Copyright information

© Springer India 2016

Authors and Affiliations

  1. 1.Indian School of MinesDhanbadIndia.

Personalised recommendations