2,120 Hits in 6.5 sec

Maximizing the Number of Broadcast Operations in Random Geometric Ad Hoc Wireless Networks

Tiziana Calamoneri, Andrea E.F. Clementi, Emanuele G. Fusco, Riccardo Silvestri
2011 IEEE Transactions on Parallel and Distributed Systems  
The goal is to provide a range assignment schedule that maximizes the number of broadcast operations from a given source (this number is denoted as the length of the schedule).  ...  We consider static ad-hoc wireless networks whose nodes, equipped with the same initial battery charge, may dynamically change their transmission range.  ...  Moreover, the design of efficient distributed implementations of such schedules is of particular relevance in ad-hoc wireless networks.  ... 
doi:10.1109/tpds.2010.77 fatcat:c3twbk55bnbapgrragwpdr7uaa

Theoretical and Algorithmic Foundations of Wireless Ad Hoc and Sensor Networks

Yu Wang, Xinbing Wang, Ping Ji, Peter Müller, Xiaohua Jia, Athanasios Vasilakos
2010 EURASIP Journal on Wireless Communications and Networking  
Recent research in mobile ad hoc networks and wireless sensor networks raises a number of interesting, and difficult, theoretical and algorithmic issues.  ...  The objective of this special issue is to gather recent advances in the areas of wireless ad hoc and sensor networks, with a focus of theoretical and algorithmic aspect.  ...  In addition, we would like to acknowledge the support from the Editor-in-Chief, Dr. Luc Vandendorpe, and thank Mostafa Salem for his help during the production of the special issue.  ... 
doi:10.1155/2010/313047 fatcat:ecpbqu4c4jcj7f24dmrw7qgc4u

A Survey on the Application of Evolutionary Algorithms for Mobile Multihop Ad Hoc Network Optimization Problems

D. G. Reina, P. Ruiz, R. Ciobanu, S. L. Toral, B. Dorronsoro, C. Dobre
2016 International Journal of Distributed Sensor Networks  
Since its origin, mobile multihop ad hoc network has evolved causing new types of multihop networks to appear such as vehicular ad hoc networks and delay tolerant networks, leading to the solution of new  ...  In this survey paper, we focus on the application of evolutionary algorithms to solve optimization problems related to a type of complex network like mobile multihop ad hoc networks.  ...  Introduction Mobile wireless multihop ad hoc networks have attracted the attention of the scientific community for more than two decades [1] [2] [3] [4] .  ... 
doi:10.1155/2016/2082496 fatcat:lebbxfpkprgufj3zpxybcvu5ki

Formulas and Protocols for Broadcasting in Mobile Ad Hoc Networks [chapter]

Chang Wu Yu, Cheng Yao Tseng
2006 Lecture Notes in Computer Science  
An operation is called broadcasting if a node sends a packet to all other nodes in an ad hoc network. Broadcasting is an elementary operation to support many applications in ad hoc networks.  ...  In the work, we derive formulas for estimating the number of required broadcasting packets by taking three different approaches.  ...  modeling and evaluating the fundamental properties of wireless ad hoc networks.  ... 
doi:10.1007/11802167_86 fatcat:5ujri6gz2vfd3e4zpbhh3vhg6y

Fast distributed algorithm for convergecast in ad hoc geometric radio networks

Alex Kesselman, Dariusz R. Kowalski
2006 Journal of Parallel and Distributed Computing  
One of the most important problems in wireless ad hoc networks is to minimize the energy consumption, which maximizes the network lifetime.  ...  Wireless ad hoc radio networks have gained a lot of attention in recent years. We consider geometric networks, where nodes are located in a euclidean plane.  ...  The gossiping problem in ad hoc radio networks attracted also studies on efficient randomized distributed algorithms. Chrobak et al.  ... 
doi:10.1016/j.jpdc.2005.11.004 fatcat:6dpirwcfvbad3b2hforvoufivq

Self-Organization in Mobile Networking Systems

Hyun-Ho Choi, Seok-Chul Kwon, Youngwook Ko, Jung-Ryun Lee
2016 Mobile Information Systems  
Current mobile communication and networking systems, such as cellular network, wireless local area network, ad hoc network, and vehicular network, require manual configuration and centralized control for  ...  Since an eNB does not know the number of MTC devices in its coverage area, it is difficult to control the barring factor by predicting the number of MTC devices in a service area of a cell.  ...  of the papers.  ... 
doi:10.1155/2016/9083762 fatcat:ldvnz5g35nhfjbm5dc33swiv4i

Applications of Geometric Algorithms to Reduce Interference in Wireless Mesh Network

Hung Chin Jang
2010 International Journal on Applications of Graph Theory In wireless Ad Hoc Networks And sensor Networks  
Wireless mesh networks usually intensively deploy mesh nodes to deal with the problem of dead spot communication.  ...  In this paper, we first convert network problems into geometry problems in graph theory, and then solve the interference problem by geometric algorithms.  ...  International journal on applications of graph theory in wireless ad hoc networks and sensor networks (Graph Hoc), Vol.  ... 
doi:10.5121/jgraphhoc.2010.2106 fatcat:qr7ethvoxbcs5gppr7bm2qkx2u

Multicast Throughput Order of Network Coding in Wireless Ad-hoc Networks

Shirish Karande, Zheng Wang, Hamid R. Sadjadpour, J. J. Garcia-Luna-Aceves
2009 2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks  
We study the contribution of network coding (NC) in improving the multicast capacity of random wireless ad hoc networks.  ...  We show that in the presence of NC, the per-session capacity under the protocol model has a tight bound of Θ "  ...  Studies such as [21] , [23] , [24] do not readily capture the geometric constraints of multi-hop communication in wireless ad-hoc networks.  ... 
doi:10.1109/sahcn.2009.5168948 dblp:conf/secon/KarandeWSG09 fatcat:er23etodtzdtlnhf3eiordmt4q

Issues and Challenges in Node Connectivity in Mobile Ad Hoc Networks: A Holistic Review

Mohit Jain, Satish Chand
2016 Wireless Engineering and Technology  
One of the fundamental properties of an ad hoc network is its connectivity. Maintaining connectivity in wireless networks is extremely difficult due to dynamic changing topology of MANETs.  ...  In this paper, we examine the existing methods and discuss the issues and challenges that are still insurmountable in order to enhance the connectivity properties of wireless multi hop networks.  ...  Classical theory of random graph models is not suitable to model the ad hoc network problems. Minimum node degree and connectivity of wireless multi hop network [40] 1.  ... 
doi:10.4236/wet.2016.71003 fatcat:5e2twwv5mrdafmhqjccdbdnoge

Modeling and optimization of Quality of Service routing in Mobile Ad hoc Networks

Marjan Kuchaki Rafsanjani, Hamideh Fatemidokht, Valentina Emilia Balas
2016 Open Physics  
In this model, we use geometric random graphs rather than random graphs.  ...  To design effective mobile ad hoc networks, it is important to evaluate the performance of multi-hop paths.  ...  The lognormal geometric random graph matches the characteristics of ad hoc networks better than other models [7] .  ... 
doi:10.1515/phys-2016-0058 fatcat:yrt3o4wravcrvdj2f5wfrpccfu

Multicast Throughput Order of Network Coding in Wireless Ad-hoc Networks

Shirish S. Karande, Zheng Wang, Hamid R. Sadjadpour, J.J. Garcia-Luna-Aceves
2011 IEEE Transactions on Communications  
We study the contribution of network coding (NC) in improving the multicast capacity of random wireless ad hoc networks.  ...  We show that in the presence of NC, the per-session capacity under the protocol model has a tight bound of Θ "  ...  Studies such as [21] , [23] , [24] do not readily capture the geometric constraints of multi-hop communication in wireless ad-hoc networks.  ... 
doi:10.1109/tcomm.2011.121410.090368 fatcat:vhjbqe5ofrdlvemshvwraz4rlq

Adaptive Probabilistic Broadcasting over Dense Wireless Ad Hoc Networks

Victor Gau, Jenq-Neng Hwang
2010 International Journal of Digital Multimedia Broadcasting  
We propose an idle probability-based broadcasting method,iPro, which employs an adaptive probabilistic mechanism to improve performance of data broadcasting over dense wireless ad hoc networks.  ...  In multisource one-hop broadcast scenarios, the modeling and simulation results of the proposediProare shown to significantly outperform the standard IEEE 802.11 under saturated condition.  ...  Broadcast is a common communication operation in wireless ad hoc networks.  ... 
doi:10.1155/2010/741792 fatcat:rlt3yxwc2zeevppypxjc7mqyt4

The Distance-2 Matching Problem and Its Relationship to the MAC-Layer Capacity of Ad Hoc Wireless Networks

H. Balakrishnan, C.L. Barrett, V.S.A. Kumar, M.V. Marathe, S. Thite
2004 IEEE Journal on Selected Areas in Communications  
We consider the problem of determining the maximum capacity of the media access (MAC) layer in wireless ad hoc networks.  ...  The maximum number of possible concurrent transmissions is, therefore, an estimate of the maximum network capacity, and depends on the MAC protocol being used.  ...  the MAC-layer interference phenomenon of ad hoc wireless networks.  ... 
doi:10.1109/jsac.2004.830909 fatcat:dhobggdnvjap5fc5rsubvsr6bm

Topological Broadcasting Using Parameter Sensitivity-Based Logical Proximity Graphs in Coordinated Ground-Flying Ad Hoc Networks

Vishal Sharma, Rajesh Kumar, Neeraj Rathore
2015 Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications  
However, these networks similar to the traditional ad hoc formations are having a major issue of broadcast storming and network partitioning. These issues hinder the performance of such networks.  ...  Broadcast storming refers to replication of similar data in the network that increases the overheads which ultimately leads to network failure.  ...  Problem Statement Aerial ad hoc networks operating in coordination with the ground ad hoc networks have multiple line of contacts between the network nodes.  ... 
doi:10.22667/jowua.2015.09.31.054 dblp:journals/jowua/SharmaKR15 fatcat:yeqjd5exaffv7adyvakvezo7ve

Distributed multi-channel topology-transparent broadcast scheduling in ad hoc networks

Yiming Liu, Victor O. K. Li, Ka-Cheong Leung, Lin Zhang
2014 2014 IEEE Wireless Communications and Networking Conference (WCNC)  
We study the performance of our algorithm analytically and obtain the optimal number of selected subchannels that maximizes the throughput.  ...  Topology-transparent scheduling algorithms can work well in mobile ad hoc networks, since they are oblivious to the network topology changes and can provide throughput and delay guarantees.  ...  Scheduling medium access in mobile wireless ad hoc networks is challenging because of node mobility, and the limited availability and variability of wireless bandwidth.  ... 
doi:10.1109/wcnc.2014.6952441 dblp:conf/wcnc/LiuLL014 fatcat:4qetuqgijjaqdgw2omalg3nska
« Previous Showing results 1 — 15 out of 2,120 results