Filters








2,750 Hits in 5.5 sec

Optimal regional consecutive leader election in mobile ad-hoc networks

Hyun Chul Chung, Peter Robinson, Jennifer L. Welch
2011 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing - FOMC '11  
The regional consecutive leader election (RCLE) problem requires mobile nodes to elect a leader within bounded time upon entering a specific region.  ...  Due to its low message bit complexity, we believe that our algorithm is of practical interest for mobile wireless ad-hoc networks.  ...  Regional consecutive leader election in mobile ad-hoc networks. In Proc. of DIALM-POMC'10, pages 81-90, 2010. [3] A. K. Datta, L. L. Larmore, and H. Piniganti.  ... 
doi:10.1145/1998476.1998485 dblp:conf/dialm/ChungRW11 fatcat:agzriuqhezdbxbo2hldmevfg7i

PALE: Partially Asynchronous Agile Leader Election [article]

Bronislav Sidik, Rami Puzis, Polina Zilberman, Yuval Elovici
2018 arXiv   pre-print
The proposed algorithm is self-sufficient, easy to implement and can be extended to support multiple regions, self-stabilization, and wireless ad-hoc networks.  ...  Thus, state-of-the-art leader election algorithms are not applicable in asynchronous environments with constant network changes.  ...  The optimal regional consecutive leader election algorithm (Optimal RCLE) [25] assumes a fixed geographic region with bounded communication diameter and unique IDs.  ... 
arXiv:1801.03734v1 fatcat:nmjwl5uynnb6va4zdmrhlfo75e

Timed Virtual Stationary Automata for Mobile Networks [chapter]

Shlomi Dolev, Seth Gilbert, Limor Lahiani, Nancy Lynch, Tina Nolte
2006 Lecture Notes in Computer Science  
Our virtual infrastructure differs in key ways from others that have previously been proposed for mobile ad-hoc networks.  ...  Our clock-enabled VSA layer is emulated by the real mobile nodes in the network. Each mobile node is assumed to have access to a GPS service informing it of the time and region it is currently in.  ...  The VSA infrastructure can be a basic building block to implement tree hierarchies in a network that could, for example, be used to allow clients to register and query attributes.  ... 
doi:10.1007/11795490_12 fatcat:ggbawn6lsvhr7irpbbz2rx66sa

Fundamental control algorithms in mobile networks

Kostas P. Hatzis, George P. Pentaris, Paul G. Spirakis, Vasilis T. Tampakas, Richard B. Tan
1999 Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures - SPAA '99  
In this work we propose simple and efficient protocols for counting and leader election in mobile networks.  ...  We also provide a simple but very efficient Compulsory (forced random walks) Las Vegas protocol for leader election in ad-hoc networks, which also allows counting, with termination detection.  ...  elects a unique leader in the ad hoc mobile network in time linear to n with a given probability of success.  ... 
doi:10.1145/305619.305649 dblp:conf/spaa/HatzisPSTT99 fatcat:4uuifi63fvd23ox5ahv7i7cety

Multi-leader election in dynamic sensor networks

Kan Yu, Meng Gao, Honglu Jiang, Guangshun Li
2017 EURASIP Journal on Wireless Communications and Networking  
Different from most of the existing results studying the multi-leader election in static networks or one leader election in dynamic networks, in this paper, we focus on the multi-leader election in dynamic  ...  Specifically, the proposed algorithms aim at using less leaders to control the whole network, which is controlled by at least k opt leaders, here k opt denotes the optimal number of network partitions.  ...  Based on the context of mobile ad hoc networks, in [12] , Malpani et al. presented a leader election algorithm in every connected component.  ... 
doi:10.1186/s13638-017-0961-9 fatcat:goifrldegnhlhmxr3cxibf4o3e

Multi-leader Election in Dynamic Sensor Networks

Meng Gao, Jiguo Yu, Kan Yu
2016 2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)  
Different from most of the existing results studying the multi-leader election in static networks or one leader election in dynamic networks, in this paper, we focus on the multi-leader election in dynamic  ...  Specifically, the proposed algorithms aim at using less leaders to control the whole network, which is controlled by at least k opt leaders, here k opt denotes the optimal number of network partitions.  ...  Based on the context of mobile ad hoc networks, in [12] , Malpani et al. presented a leader election algorithm in every connected component.  ... 
doi:10.1109/iiki.2016.80 dblp:conf/iiki/GaoYY16 fatcat:7kb37em3f5f37bpy6tgmyxyzwy

On the Fundamental Limits of Broadcasting in Wireless Mobile Networks

Giovanni Resta, Paolo Santi
2010 2010 Proceedings IEEE INFOCOM  
This study intendedly ignores the burden related to the selection of broadcast relay nodes within the mobile network, and shows that optimal broadcasting in mobile networks is, in principle, possible.  ...  In this paper, we investigate the fundamental properties of broadcasting in mobile wireless networks.  ...  The work that is closest to our is [2] , where the authors present a location-based broadcasting protocol for mobile ad hoc networks, and formally characterize the number of communication steps needed  ... 
doi:10.1109/infcom.2010.5462260 dblp:conf/infocom/RestaS10 fatcat:eg2gym5xczgqnef3p4oslrs23m

Robust Leader Election in a Fast-Changing World

John Augustine, Tejas Kulkarni, Paresh Nakhe, Peter Robinson
2013 Electronic Proceedings in Theoretical Computer Science  
Thus, our results also apply to mobile wireless ad-hoc networks, improving over the optimal (for deterministic algorithms) O(Dn) solution presented at FOMC 2011.  ...  We consider the problem of electing a leader among nodes in a highly dynamic network where the adversary has unbounded capacity to insert and remove nodes (including the leader) from the network and change  ...  Towards this goal, we argue based on a node u whose leader variable is set to ⊥ either because it has just entered the network or has not heard a beep message in the last D rounds.  ... 
doi:10.4204/eptcs.132.4 fatcat:76uvpn7gqfgxbihqrc6tfurr5a

Performance optimization of region-based group key management in mobile ad hoc networks

Jin-Hee Cho, Ing-Ray Chen, Ding-Chau Wang
2008 Performance evaluation (Print)  
We propose and analyse a scalable and efficient region-based group key management protocol for secure group communications in mobile ad hoc networks.  ...  A key design in our region-based group key management scheme is to identify the optimal region size to minimize network traffic due to key management operations and mobility-induced events in MANETs.  ...  Introduction A mobile ad hoc network (MANET) consists of a set of wireless mobile devices communicating with each other without an infrastructure.  ... 
doi:10.1016/j.peva.2007.07.002 fatcat:7aiergghr5dqla3qcnuk4ebzgm

The fundamental limits of broadcasting in dense wireless mobile networks

Giovanni Resta, Paolo Santi
2012 Wireless networks  
This study intendedly ignores the burden related to the selection of broadcast relay nodes within the mobile network, and shows that optimal broadcasting in mobile networks is, in principle, possible.  ...  In this paper, we investigate the fundamental properties of broadcasting in mobile wireless networks.  ...  The work that is closest to our is [2] , where the authors present a location-based broadcasting protocol for mobile ad hoc networks, and formally characterize the number of communication steps needed  ... 
doi:10.1007/s11276-012-0427-2 fatcat:pmhrtsp4o5cmfhk5hxly77rgym

AMHC: Adaptive Multi-Hop Clustering based Resource Discovery Architecture for Large Scale MANETs

Saad Al-Ahmadi, Abdullah Al-Dhelaan
2014 Research Journal of Applied Sciences Engineering and Technology  
In this study we propose an efficient clustering protocol called AMHC used for resource discovery in large scale Mobile Ad hoc Networks (MANETs).  ...  AMHC is an Adaptive Multi-Hop Clustering generating several non-overlapping network localities (clusters) with explicit elected cluster-heads.  ...  In MANET, the movement of the network nodes may quickly change the network topology resulting in the increase of the overhead message in topology maintenance; the clustering schemes for mobile ad hoc networks  ... 
doi:10.19026/rjaset.7.710 fatcat:hgkblxlkwreirphigvifpgiyzy

Scalable multicast routing for ad hoc networks

Manoj Pandey, Daniel Zappala
2008 2008 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems  
Routing in a mobile ad hoc network is challenging because nodes can move at any time, invalidating a previouslydiscovered route.  ...  Providing scalable solutions to this problem typically requires building a hierarchy or an overlay network to reduce the cost of route discovery and maintenance.  ...  One approach is to create a hierarchy by partitioning the network into regions, with a group leader elected in each region [7] .  ... 
doi:10.1109/mahss.2008.4660088 dblp:conf/mass/PandeyZ08a fatcat:gwgjimwa5vaw5estaooumffjqm

A dynamic data/currency protocol for mobile database design and reconfiguration

Yanli Xia, Abdelsalam (Sumi) Helal
2003 Proceedings of the 2003 ACM symposium on Applied computing - SAC '03  
Scenarios of Ad-hoc Network to Fixed Network As shown in the figure 2-3, an ad-hoc network may be all docked, half-docked or all undocked to the fixed network.  ...  When some or all of mobile hosts weak connected, they form an ad-hoc network and their database is an ad-hoc database.  ... 
doi:10.1145/952532.952640 dblp:conf/sac/XiaH03 fatcat:5zaduwf5cvczzb2y3ylf5xyaju

Distributed topology construction of Bluetooth wireless personal area networks

T. Salonidis, P. Bhagwat, L. Tassiulas, R. LaMaire
2005 IEEE Journal on Selected Areas in Communications  
Bluetooth, a wireless technology based on a frequency hopping physical layer, enables portable devices to form short-range wireless ad hoc networks.  ...  An attractive protocol feature is its ease in implementation using the communication primitives offered by the Bluetooth Specification.  ...  Compared to other forms of ad hoc networks, such as Mobile Ad Hoc Networks (MANETs) or sensor networks, WPANs are characterized by a relatively small number of low-power devices operating within a limited  ... 
doi:10.1109/jsac.2004.842567 fatcat:wnn5e46j4fgofpwmf7xdrrg65u

A centralized cluster-based hierarchical approach for green communication in a smart healthcare system

Guojie Yang, Mian Ahmad Jan, Varun G Menon, PG Shynu, Mian Muhammad Aimal, Mohammad Dahman Alshehri
2020 IEEE Access  
He has been guest editor of numerous special issues in various prestigious journals such as Elsevier Future Generation Computer Systems, Springer Mobile Networks and Applications (MONET), Ad Hoc & Sensor  ...  The base station elects an optimal number of cluster heads and advertise them in the network.  ... 
doi:10.1109/access.2020.2998452 fatcat:mgyn5i6sajcd5d5zyetretfvcm
« Previous Showing results 1 — 15 out of 2,750 results