Reduction in Resource Consumption to Enhance Cooperation in MANET Using Compressive Sensing

  • Md. Amir Khusru Akhtar
  • G. Sahoo
Conference paper
Part of the Smart Innovation, Systems and Technologies book series (SIST, volume 44)


Energy and bandwidth are the scarce resource in a wireless network. In order to prolong its life nodes drop packets of others to save these resources. These resources are the major cause of selfish misbehavior or noncooperation. To enforce nodes cooperation this paper presents the reduction in resource consumption using Compressive Sensing. Our model compresses the neighborhood sparse data such as routing table updates and other advertisement. We have divided a MANET in terms of the neighborhood called neighborhood group (NG). Sparse data are compressed by neighborhood node and then forwarded to the leader node. The leader node joins all neighborhood data to reconstruct the original data and then broadcasts in its neighborhood. This gives a reduction in resource consumption because major computations are performed at leader end which saves battery power of neighborhood nodes. It compresses sparse data before transmission thus reduces the amount of transmitting data in the network which saves the total energy consumption to prolong life of the network. It also prevents from several attacks because individual nodes do not accept the advertisement and updates directly rather it uses leader node processed information.


Compressive sensing Neighborhood group Leader node Border node Regular node Malicious node Neighborhood compressive sensing 


  1. 1.
    Anusas-Amornkul, T.: On detection mechanisms and their performance for packet dropping attack in ad hoc networks. ProQuest (2008)Google Scholar
  2. 2.
    Wang, Y.: Enhancing node cooperation in mobile wireless ad hoc networks with selfish nodes. University of Kentucky, Doctoral Dissertations. Paper 602 (2008).
  3. 3.
    Candes, E.: Compressive sampling. In: Proceedings of International Congress of Mathematicians, pp. 1433–1452. Mathematical Society Publishing House (2006)Google Scholar
  4. 4.
    Donoho, D.L.: Compressed sensing. IEEE Trans. Inf. Theory 52(4), 1289–1306 (2006)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Saeed, N.H., Abbod, M.F., Al-Raweshidy, H.S.: IMAN: an Intelligent MANET routing system. In: Proceedings of the IEEE 17th International Conference on Telecommunications (ICT), pp. 401–404. IEEE (2010)Google Scholar
  6. 6.
    Saeed, N.: Intelligent MANET optimisation system. Ph.D. Thesis, School of Engineering and Design, Electronic and Computer Engineering Department, Brunel University, Brunel University (2011)Google Scholar
  7. 7.
    Chiang, T.C., Tsai, H.M., Huang, Y.M.: A partition network model for ad hoc networks. In: IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, 2005 (WiMob’2005), vol. 3, pp. 467–472. IEEE (2005)Google Scholar
  8. 8.
    Lopez, J., Barceló, J.M., García-Vidal, J.: Subnet formation and address allocation approach for a routing with subnets scheme in MANETs. In: Wireless Systems and Network Architectures in Next Generation Internet, pp. 62–77. Springer, Berlin (2006)Google Scholar
  9. 9.
    Chowdhury, M.A.H., Ikram, M., Kim, K.H.: Secure and survivable group communication over MANET using CRTDH based on a virtual subnet model. In: Asia-Pacific Services Computing Conference, (APSCC’08), pp. 638–643. IEEE (2008)Google Scholar
  10. 10.
    Chang, C.W., Yeh, C.H., Tsai, C.D.: An efficient authentication protocol for virtual subnets on mobile ad hoc networks. In: International Symposium on Computer Communication Control and Automation (3CA), vol. 2, pp. 67–70. IEEE (2010)Google Scholar
  11. 11.
    Vilhekar, A.A., Jaidhar, C.D.: Modified authentication protocol using elliptic curve cryptosystem for virtual subnets on mobile adhoc networks. In: Wireless Communications and Applications, pp. 426–432. Springer, Berlin Heidelberg (2012)Google Scholar
  12. 12.
    Akhtar, M.A.K., Sahoo, G.: A novel methodology for securing ad hoc network by friendly group model. In: Computer Networks and Communications (NetCom), vol. 131, pp. 23–35. Springer (2013)Google Scholar
  13. 13.
    Lee, S., Pattem, S., Sathiamoorthy, M., Krishnamachari, B., An Ortega, A.: Compressed sensing and routing in multi-hop networks. University of Southern California CENG Technical Report (2009)Google Scholar
  14. 14.
    Chou, C.T., Rana, R., Hu, W.: Energy efficient information collection in wireless sensor networks using adaptive compressive sensing. In: Proceedings of 34th Conference on Local Computer Networks, (LCN 2009), pp. 443–450. IEEE (2009)Google Scholar
  15. 15.
    Feizi, S., Médard, M., Effros, M.: Compressive sensing over networks. In: Proceedings of 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 1129–1136. IEEE (2010)Google Scholar
  16. 16.
    Zhang, L., Luo, J., Guo, D.: Neighbor discovery for wireless networks via compressed sensing. Performance Evaluation (2012)Google Scholar
  17. 17.
    Xiong, J., Zhao, J., Xuan, L.: Research on the combining of compressed sensing and network coding in wireless sensor network. J. Theor. Appl. Inform. Technol. 47(3) (2013)Google Scholar
  18. 18.
    Aziz, A., Salim, A., Osamy, W.: Adaptive and efficient compressive sensing based technique for routing in wireless sensor networks. In: The INTHITEN (INternet of THings and ITs ENablers) Conference, The Bonch-Bruevich State University of Telecommunications (SUT), St Petersburg, Russia (2013)Google Scholar
  19. 19.
    Zheng, H., Wang, X., Tian, X., Xiao, S.: Data gathering with compressive sensing in wireless sensor networks: an in-network computation perspective (2012).
  20. 20.
    Zheng, H., Xiao, S., Wang, X., Tian, X.: Energy and latency analysis for in-network computation with compressive sensing in wireless sensor networks. In: Proceedings of the INFOCOM, pp. 2811–2815. IEEE (2012)Google Scholar
  21. 21.
    Tropp, J.A., Gilbert, A.C.: Signal recovery from random measurements via orthogonal matching pursuit. IEEE Trans. Inf. Theory 53(12), 4655–4666 (2007)MathSciNetCrossRefMATHGoogle Scholar
  22. 22.
    Singh, A.K., Sharma, S.: Elite leader finding algorithm for MANETs. In: Proceedings of the 10th International Symposium on Parallel and Distributed Computing (ISPDC), pp. 125–132. IEEE (2011)Google Scholar
  23. 23.
    Mohammed, N., Otrok, H., Wang, L., Debbabi, M., Bhattacharya, P.: Mechanism design-based secure leader election model for intrusion detection in MANET. IEEE Trans. Dependable Secure Comput. 8(1), 89–103 (2011)CrossRefGoogle Scholar

Copyright information

© Springer India 2016

Authors and Affiliations

  1. 1.Cambridge Institute of TechnologyTatisilwaiIndia
  2. 2.Birla Institute of TechnologyMesraIndia

Personalised recommendations