Filters








255 Hits in 6.2 sec

Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences [chapter]

Jean-Claude Bermond, Min-Li Yu
Lecture Notes in Computer Science  
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints.  ...  We present optimal algorithms that give minimum number of steps (delay) for the gathering problem with buffering possibility, when the network is a tree, the root is the destination and dI = 1.  ...  Acknowledgments We would like to thank all the persons who help us with fruitful discussions in particular L. Gargano, A. Liestman, J. Peters and S. Perennes.  ... 
doi:10.1007/978-3-540-85209-4_16 fatcat:bjghza5zyrgtrinf7fqofxu7j4

Design of scalable and efficient multi-radio wireless networks

Djohara Benyamina, Abdelhakim Hafid, Michel Gendreau
2011 Wireless networks  
Index Terms-Wireless mesh networks, Network design and optimization, Clustering, Constraint satisfaction, Scalability. goal when designing multi-radio wireless networks since the impact of inter-path (  ...  or co-channel) interferences on network performance is reduced.  ...  G (11) 6) Co-channel Interference: A key issue impacting any multi-hop network performance is the co-channel interference.  ... 
doi:10.1007/s11276-011-0388-x fatcat:qrwz2inuqjbghaiqrdnkpapcqu

Machine-to-machine communications: Technologies and challenges

Kwang-Cheng Chen, Shao-Yu Lien
2014 Ad hoc networks  
Related technologies toward practical realization are explored to complete fundamental understanding and engineering knowledge of this new communication and networking technology front.  ...  We use Fig. 5 to illus-trate multi-hop cognitive radio networking in machine swarm or sensor networks.  ...  However, instead of the assumption on control information of entire network in this approach, this approach assumes that the multi-hop tree network topology that still requires efforts to establish in  ... 
doi:10.1016/j.adhoc.2013.03.007 fatcat:fsd6zefdq5fotbm5vhpozc4wci

Multiple Sink Based Compressive Data Aggregation Technique for Wireless Sensor Network

Mohamed Yacoab M.Y, V Sundaram
2011 International Journal of Wireless & Mobile Networks  
In addition, the radio channel capacity close to the sink may become overloaded if the average number of hops between the source and the sink becomes excess [10] . 3] In single sink network architectures  ...  A common function of the sensor network is data gathering.  ...  Efficient data gathering trees are formed by the nodes and then the best sink is chosen for transferring the data in multiple sink networks.  ... 
doi:10.5121/ijwmn.2011.3215 fatcat:al5hpvpravcatalxrvmmceojui

Development of A New Efficient Routing Scheme for WiMAX Mesh Networks

Sk. Md. Abdullah Al Subail, Sk. Md. Masudul Ahsan, Mostafa Enayetullah
2013 International Journal of Modern Education and Computer Science  
In PMP architecture, there is a multi-hop mesh that can be used to gain the high speed wide area network. Again in mesh topology, it increases the wireless coverage and reconfigures ability.  ...  The purpose of our thesis work is to propose a new routing algorithm to maximize the performance of the network. term of hops which connect together to form the wireless mesh network [5] .  ...  Based on the wireless mesh network, the IEEE 802.16/WiMAX standard provides a mechanism for creating multi-hop mesh, which can be deployed as a high speed wide-area wireless network.  ... 
doi:10.5815/ijmecs.2013.10.04 fatcat:ymdnsnfzmfd2rmfrxyrgvtnx7a

The distributed wireless gathering problem

Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie
2011 Theoretical Computer Science  
126] we prove that the algorithm is (1 + ϵ)-competitive, when the algorithm sends packets a factor O(log(δ/ϵ) log ∆) faster than the optimal off-line solution; here δ is the radius of the network and ∆  ...  We finally extend this result to a more complex interference model.  ...  a b s t r a c t We address the problem of data gathering in a wireless network using multi-hop communication; our main goal is the analysis of simple algorithms suitable for implementation in realistic  ... 
doi:10.1016/j.tcs.2010.10.018 fatcat:zmvjogc57fdnxkrpo7qbh5axvy

A scalable code dissemination protocol in heterogeneous wireless sensor networks

ShaoLiang Peng, ShanShan Li, XiangKe Liao, YuXing Peng, Nong Xiao
2011 Science China Information Sciences  
Code dissemination is currently a major research issue in wireless sensor networks (WSNs).  ...  We further designed two scalable schemes, special routing log and hops-restricted local broadcast, which compress the multicast tree information and deliver the multicast messages without loss.  ...  MNP [6] is targeted at MICA2 motes running TinyOS and uses the XNP boot loader along with a dedicated network protocol to provide multi-hop, in-network programming.  ... 
doi:10.1007/s11432-011-4482-6 fatcat:snxuh7ytdfacvivslk3mnbocdi

Minimizing flow time in the wireless gathering problem

Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie
2011 ACM Transactions on Algorithms  
We address the problem of efficient data gathering in a wireless network through multi-hop communication. We focus on the objective of minimizing the maximum flow time of a data packet.  ...  We prove that this strategy is 5-speed optimal, i.e., its cost remains within the optimal cost if we allow the algorithm to transmit data at a speed 5 times higher than that of the optimal solution we  ...  They provided a 2-approximation algorithm for tree networks and an optimal algorithm for line networks.  ... 
doi:10.1145/1978782.1978788 fatcat:nu63ew3q5nfo5hrpuh7o2dwfca

Minimizing Flow Time in the Wireless Gathering Problem [article]

Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie
2008 arXiv   pre-print
We address the problem of efficient data gathering in a wireless network through multi-hop communication. We focus on the objective of minimizing the maximum flow time of a data packet.  ...  We prove that this strategy is 5-speed optimal, i.e., its cost remains within the optimal cost if we allow the algorithm to transmit data at a speed 5 times higher than that of the optimal solution we  ...  They provided a 2-approximation algorithm for tree networks and an optimal algorithm for line networks.  ... 
arXiv:0802.2836v1 fatcat:qycn4mfeerg4dc2zboikjfr424

Almost optimal distributed M2M multicasting in Wireless Mesh Networks

Qin Xin, Fredrik Manne, Yan Zhang, Jianping Wang, Zeyu Zheng
2009 2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems  
In this paper, we study the problem of multipoint-to-multipoint (M2M) multicasting in a WMN which aims to use the minimum number of time slots to exchange messages among a group of k mesh nodes in a multi-hop  ...  This is an asymptotically optimal algorithm in the sense that there exists a WMN topology, e.g., a line, a ring, a star or a complete graph, in which the M2M multicasting cannot be completed in less than  ...  via multi-hop routing.  ... 
doi:10.1109/mobhoc.2009.5337015 dblp:conf/mass/XinMZWZ09 fatcat:u2pda6alszgfbjfu3jkrtvknwy

TreeMAC: Localized TDMA MAC protocol for real-time high-data-rate sensor networks

Wen-Zhan Song, Renjie Huang, Behrooz Shirazi, Richard LaHusen
2009 Pervasive and Mobile Computing  
Earlier sensor network MAC protocols focus on energy conservation in low-duty cycle applications, while some recent applications involve real-time high-data-rate signals.  ...  This motivates us to design an innovative localized TDMA MAC protocol to achieve high throughput and low congestion in data collection sensor networks, besides energy conservation.  ...  Those MAC protocols are not optimized for data gathering sensor network applications.  ... 
doi:10.1016/j.pmcj.2009.07.004 fatcat:wmzzalrgjjesjilqajmf67lz4u

Monitoring Technologies in Mission-Critical Environment by Using Wireless Sensor Networks [chapter]

Yuanyuan Zeng, Kai Xiang, Deshi Li
2012 Wireless Sensor Networks - Technology and Applications  
Actually, the incidence of routing holes increases as network density diminishes and the success rate of the greedy algorithm drops very quickly with network density.  ...  The "Routing Hole" problem is a very important and well-studied problem in network connectivity, where messages get trapped in a "local minimum" that can be incurred by network partitions.  ...  Wireless Sensor Networks 239 graph G (V ,E )w ith initial pow er p 0 (b)Network graph G ' (V ,E ;P ) w ith tw o pow er levels for each node Figure 3 . 3 The multi-edge graph G' Algorithm 1 : 1 Multi-agent  ... 
doi:10.5772/48185 fatcat:ctpbnn3o3jgabehua6nywzz4ke

Efficient Broadcasting in Multi-radio Multi-channel and Multi-hop Wireless Networks Based on Self-pruning [chapter]

Li Li, Bin Qin, Chunyuan Zhang, Haiyan Li
2007 Lecture Notes in Computer Science  
An important question in multi-radio multi-channel and multi-hop networks is how to perform efficient network-wide broadcast.  ...  Currently almost all broadcasting protocols assume a single-radio single-channel network model.  ...  An important question in multi-radio multi-channel multi-hop networks which we attempt to address in this paper is how to perform efficient network-wide broadcast in such networks.  ... 
doi:10.1007/978-3-540-75444-2_47 fatcat:lauq34cyo5fo7gdodxwvvfeb3e

Energy-aware QoS provisioning for wireless sensor networks: Analysis and protocol

Muhammad Mahbub Alam, Md. Abdur Razzaque, Md. Mamun-Or-Rashid, Choong Seon Hong
2009 Journal of Communications and Networks  
In this paper, we propose an energy-aware, multi-constrained and multipath QoS provisioning mechanism for WSNs based on optimization approach.  ...  Hence, a detailed analytical analysis of reliability, delay and energy consumption is presented to formulate the optimization problem in an analytical way.  ...  ACKNOWLEDGMENT The authors like to thank the anonymous referees for their valuable and constructive comments, which helped greatly in improving the quality and presentation of this paper.  ... 
doi:10.1109/jcn.2009.6391353 fatcat:rf5l4zrxzndddhv4gsifmfyy24

Maximum lifetime data sensing and extraction in energy constrained networked sensor systems

Bo Hong, Viktor K. Prasanna
2006 Journal of Parallel and Distributed Computing  
We focus on data gathering problems in energy constrained networked sensor systems.  ...  We further develop a strongly polynomial time algorithm for this problem, which is guaranteed to find an optimal solution.  ...  The data gathering processes are usually implemented using multi-hop packet transmissions, since short-range communications can save energy and also reduce communication interferences in high density networked  ... 
doi:10.1016/j.jpdc.2005.10.009 fatcat:3cpsay5crfe6pnvrsnsrykpvkq
« Previous Showing results 1 — 15 out of 255 results