A new mechanism for MPR selection in mobile ad hoc and sensor wireless networks

被引:0
作者
Belichira, Sid Ahmed Hichame [1 ,2 ]
Boukli-Hacene, Sofiane [3 ]
Lorenz, Pascal [4 ]
Belkheir, Mohamed [5 ]
Gilg, Marc [4 ]
Zerroug, Abdelhalim [6 ]
机构
[1] Univ Ctr Nour Bachir El Bayadh, Elbayadh, Algeria
[2] Univ Haute Alsace, Mulhouse, France
[3] Univ Djillali Liabes Sidi Bel Abbes, EEDIS Lab, Sidi Bel Abbes, Algeria
[4] Univ Haute Alsace, IRIMAS Lab, Colmar, France
[5] Univ Ctr Nour Bachir El Bayadh, LIMA Lab, Elbayadh, Algeria
[6] SONATRACH Oil & Gas Co, Algiers, Algeria
来源
ICC 2020 - 2020 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC) | 2020年
关键词
Ad hoc Wireless Sensor Networks; OLSR; Network Lifetime; Energy Optimization; MPRs;
D O I
10.1109/icc40277.2020.9148633
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In mobile and sensor wireless networks, liaising between wireless nodes is performed using routing protocols. Each protocol has its advantages and drawbacks. OLSR is one of the most widely used protocols, due its proactive scheme. It is based on the principle of Multi Point Relay (MPR) which essentially consists in building a "relevant" set of links and direct neighbors by ignoring redundancies in order to have optimal paths. This relevance is demonstrated by criteria that allow the entire neighborhood of a node to be reached by two hops (all neighbors of neighbors). However, these criteria do not take into consideration other important factors that have a strong influence on the protocol's behavior such as the residual energy, which may lead to degrading the overall network lifetime. In this paper, we present a new method to overcome this problem, allowing mobile nodes within ad hoc and sensor wireless networks to determine an efficient set of their routers using OLSR Protocol, based on the energy constraint of their neighborhood. Due to the random mobility of nodes in such networks, an efficient calculation algorithm of routers for each node seems an obligation, in order to avoid link breakage and assure a high level of the network availability. Our new algorithm consists on introducing a dynamic weighting ratio between the reachability and the residual energy of the one hop neighbors of each node for selecting its routers. One of a statistical method to discover the neighborhood is the dispersion calculation of the residual energy that allows a node to find out how spreads are energies of its neighborhood. This calculation is introduced in the router selection algorithm. Thus, this method allows a load balancing in the network and avoids the rapid decrease of nodes batteries that have been selected as routers for a long time. Simulations results show that our new approach significantly increases the lifetime of the mobile ad hoc networks by decreasing the dead nodes number.
引用
收藏
页数:6
相关论文
共 50 条
  • [31] Intelligent self-organization methods for wireless ad hoc sensor networks based on limited resources
    Hortos, William S.
    INTELLIGENT COMPUTING: THEORY AND APPLICATIONS IV, 2006, 6229
  • [32] A Hybrid Key Management Scheme for Ad-hoc Wireless Sensor Networks to improvesecure link establishment
    Rehman, Saif ur
    Gang, Cui
    Purevsuren, Dalaijargal
    PROCEEDINGS OF 2015 6TH IEEE INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND SERVICE SCIENCE, 2015, : 119 - 122
  • [33] An Energy-Efficient On-Demand Multicast Routing Protocol for Wireless Ad Hoc and Sensor Networks
    Hao, Jie
    Duan, Guojian
    Zhang, Baoxian
    Li, Cheng
    2013 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2013, : 4650 - 4655
  • [34] Location service design with a platform-based approach in ad-hoc wireless sensor networks
    Graziosi, F
    Santucci, F
    Tennina, S
    GLOBECOM 2004: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE WORKSHOPS, 2004, : 240 - 244
  • [35] Using ant-based agents for congestion control in ad-hoc wireless sensor networks
    Sanjay K. Dhurandher
    Sudip Misra
    Harsh Mittal
    Anubhav Agarwal
    Isaac Woungang
    Cluster Computing, 2011, 14 : 41 - 53
  • [36] Using ant-based agents for congestion control in ad-hoc wireless sensor networks
    Dhurandher, Sanjay K.
    Misra, Sudip
    Mittal, Harsh
    Agarwal, Anubhav
    Woungang, Isaac
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2011, 14 (01): : 41 - 53
  • [37] An Energy-Efficient On-Demand Multicast Routing Protocol for Wireless Ad Hoc and Sensor Networks
    Hao, Jie
    Duan, Guojian
    Zhang, Baoxian
    Li, Cheng
    2013 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2013, : 4348 - 4353
  • [38] A practical reliable reputation based data fusion method for ad-hoc wireless sensor networks
    Wang, Fang
    Wei, Zhe
    Sun, Le
    COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 2016, 31 (03): : 197 - 207
  • [39] An Efficient Routing Protocol with No Acknowledgement Algorithm in Ad-hoc Wireless Sensor Network
    Chen, Ching-Mu
    Chan, Tung-Jung
    Chen, Tair-Rong
    PROCEEDINGS OF THE 12TH WSEAS INTERNATIONAL CONFERENCE ON COMMUNICATIONS: NEW ASPECTS OF COMMUNICATIONS, 2008, : 375 - 379
  • [40] LEAD: Energy Efficient Protocol for Wireless Ad Hoc Networks
    Mishra, Subhankar
    Satpathy, Sudhansu Mohan
    Mishra, Abhipsa
    ADVANCES IN NETWORKS AND COMMUNICATIONS, PT II, 2011, 132 : 99 - 106