Connectivity and energy-aware preorders for mobile ad-hoc networks

被引:1
作者
Gallina, Lucia [1 ]
Marin, Andrea [1 ]
Rossi, Sabina [1 ]
机构
[1] Univ Ca Foscari Venezia, DAIS, Via Torino 155, I-30172 Mestre Venezia, Italy
关键词
Manets; Process algebras; Energy conservation; Performance evaluation; Simulation; WIRELESS; PROTOCOLS; CALCULUS;
D O I
10.1007/s11235-015-0122-6
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
Network connectivity and energy conservation are two major goals in mobile ad-hoc networks (MANETs). In this paper we propose a probabilistic, energy-aware, broadcast calculus for the analysis of both such aspects of MANETs. We first present a probabilistic behavioural congruence together with a co-inductive proof technique based on the notion of bisimulation. Then we define an energy-aware preorder over networks. The behavioural congruence allows us to verify whether two networks exhibit the same (probabilistic) connectivity behaviour, while the preorder makes it possible to evaluate the energy consumption of different, but behaviourally equivalent, networks. In practice, the quantitative evaluation of the models is carried out by resorting to the statistical model checking implemented in the PRISM tool, i.e., a simulation of the probabilistic model. We consider two case studies: first we evaluate the performance of the Location Aided Routing protocol, then we compare the energy efficiency of the Go-Back-N protocol with that of the Stop-And-Wait in a network with mobility.
引用
收藏
页码:307 / 333
页数:27
相关论文
共 50 条
  • [41] Energy aware routing in ad hoc networks
    Joshi, Radhika D.
    Rege, Priti P.
    [J]. PROCEEDINGS OF THE WSEAS INTERNATIONAL CONFERENCE ON CIRCUITS, SYSTEMS, ELECTRONICS, CONTROL & SIGNAL PROCESSING: SELECTED TOPICS ON CIRCUITS, SYSTEMS, ELECTRONICS, CONTROL & SIGNAL PROCESSING, 2007, : 469 - 475
  • [42] Dynamic fuzzy logic and reinforcement learning for adaptive energy efficient routing in mobile ad-hoc networks
    Chettibi, Saloua
    Chikhi, Salim
    [J]. APPLIED SOFT COMPUTING, 2016, 38 : 321 - 328
  • [43] A local filtering-based energy-aware routing scheme in flying ad hoc networks
    Hosseinzadeh, Mehdi
    Husari, Fatimatelbatoul Mahmoud
    Yousefpoor, Mohammad Sadegh
    Lansky, Jan
    Min, Hong
    [J]. SCIENTIFIC REPORTS, 2024, 14 (01):
  • [44] Direction-aware routing protocol for mobile ad hoc networks
    Chung, WH
    Kuo, SY
    Chen, SI
    [J]. 2002 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CIRCUITS AND SYSTEMS AND WEST SINO EXPOSITION PROCEEDINGS, VOLS 1-4, 2002, : 165 - 169
  • [45] Energy Consumption Evaluation of AODV and AOMDV Routing Protocols in Mobile Ad-Hoc Networks
    Mokbal, Fawaz Mahiuob Mohammed
    Saeed, Khalid
    Dan, Wang
    [J]. INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2018, 9 (08) : 278 - 288
  • [46] Energy Efficient With Secured Reliable Routing Protocol (EESRRP) For Mobile Ad-Hoc Networks
    Vadivel, R.
    Bhaskaran, V. Murali
    [J]. 2ND INTERNATIONAL CONFERENCE ON COMPUTER, COMMUNICATION, CONTROL AND INFORMATION TECHNOLOGY (C3IT-2012), 2012, 4 : 703 - 707
  • [47] Evaluation of Clustering and Multi-hop Routing Protocols in Mobile Ad-hoc Sensor Networks
    Jambli, M. N.
    Hendrick, A.
    Julaihi, A. A.
    Abdullah, J.
    Suhaili, S. M.
    [J]. 2015 9TH INTERNATIONAL CONFERENCE ON IT IN ASIA (CITA), 2015,
  • [48] Towards a Scalable Routing Approach for Mobile Ad-hoc Networks
    Ramrekha, Tipu A.
    Adigun, Olayinka
    Ladas, Alexandros
    Weerasinghe, Nuwan
    Politis, Christos
    [J]. 2015 IEEE 20TH INTERNATIONAL WORKSHOP ON COMPUTER AIDED MODELLING AND DESIGN OF COMMUNICATION LINKS AND NETWORKS (CAMAD), 2015, : 261 - 266
  • [49] MOTION: An Application of ASMETA to Mobile Ad-hoc NETworks Domain
    Bevilacqua, Gianluca Gennaro
    Bianchi, Alessandro
    [J]. ECSA 2018: PROCEEDINGS OF THE 12TH EUROPEAN CONFERENCE ON SOFTWARE ARCHITECTURE: COMPANION PROCEEDINGS, 2018,
  • [50] Low cost routing in mobile ad-hoc networks: Is it achievable?
    Baldoni, R
    Beraldi, R
    [J]. EIGHTH IEEE WORKSHOP ON FUTURE TRENDS OF DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS, 2001, : 105 - 111