Filters








359,258 Hits in 2.7 sec

Efficient communication in unknown networks

Luisa Gargano, Andrzej Pelc, Stéphane Pérennes, Ugo Vaccaro
2001 Networks  
doi:10.1002/net.1022 fatcat:4f5x3npwbre5zonoidnzr4mp4y

Efficient Communication in Unknown Networks [chapter]

Luisa Gargano, Andrzej Pelc, Stephane Perennes, Ugo Vaccaro
2000 Lecture Notes in Computer Science  
doi:10.1007/3-540-40064-8_17 fatcat:6zo2xdqwhbbnzi7oeh2ofk2cye

Energy Efficient Randomized Communication in Unknown AdHoc Networks [article]

Petra Berenbrink and Colin Cooper and Zengjian Hu
2006 arXiv   pre-print
This paper studies broadcasting and gossiping algorithms in random and general AdHoc networks.  ...  / (n/D)) messages per node in order to finish broadcasting in optimal time.  ...  Introduction In this paper we study two fundamental network communication problems, broadcasting and gossiping in unknown AdHoc networks.  ... 
arXiv:cs/0612074v1 fatcat:r5cirp2ceraklarh4knd3oeziu

Energy efficient randomised communication in unknown AdHoc networks

Petra Berenbrink, Colin Cooper, Zengjian Hu
2009 Theoretical Computer Science  
This paper studies broadcasting and gossiping algorithms in random and general AdHoc networks.  ...  2 n/ log(n/D)) messages per node in order to finish broadcasting in optimal time.  ...  Introduction In this paper we study two fundamental network communication problems, broadcasting and gossiping in unknown AdHoc networks.  ... 
doi:10.1016/j.tcs.2009.02.002 fatcat:dfgpsykc4vc3fjy3h7p4bokw7y

Energy efficient randomised communication in unknown AdHoc networks

Petra Berenbrink, Zengjian Hu, Colin Cooper
2007 Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '07  
This paper studies broadcasting and gossiping algorithms in random and general AdHoc networks.  ...  2 n/ log(n/D)) messages per node in order to finish broadcasting in optimal time.  ...  INTRODUCTION In this paper we study two fundamental network communication problems, broadcasting and gossiping in unknown AdHoc networks.  ... 
doi:10.1145/1248377.1248419 dblp:conf/spaa/BerenbrinkHC07 fatcat:4f7o4vjwozhdroz3hh7j4enjzi

Communication-Efficient Tracking of Unknown, Spatially Correlated Signals in Ad-Hoc Wireless Sensor Networks: Two Machine Learning Approaches

Hadi Alasti
2021 Sensors  
A low-cost machine learning (ML) algorithm is proposed and discussed for spatial tracking of unknown, correlated signals in localized, ad-hoc wireless sensor networks.  ...  In this paper, the percentage of wireless sensors that initiate a communication attempt is assumed as cost.  ...  In WSN, among sensing, computation and communication; communication tangibly consumes most of the in-network energy.  ... 
doi:10.3390/s21155175 fatcat:zvty4jdnvbhpjnrjnjbqzknfdm

Multiagent Based Multipath Routing In Wireless Sensor Networks

Vidya S. Bennur, Sadashiv S. Shirabur, Ashok V. Sutagundar
2014 International Journal of Wireless & Mobile Networks  
The operation of proposed routing technique can be briefly explained as follows. (1) Anchor nodes are deployed evenly over the network environment. (2) Unknown sensor nodes are deployed randomly over network  ...  The performance of the proposed scheme is evaluated in terms of performance parameters such as localization error, network lifetime, energy consumption, cost factor, packet delivery ratio, and latency.  ...  In this network environment the sensor nodes are classified in two types which are unknown sensor node and anchor node.  ... 
doi:10.5121/ijwmn.2014.6207 fatcat:c4iftju7grexpboo32qyk6zrma

Efficient Energy Utilization and Node Localization in Dynamic DV-Hop Algorithm for Wireless Sensor Networks

Saroj Kumar Rout, Amiya Kumar Rath, Bigyan Ranjan Rout
2016 Indian Journal of Science and Technology  
In the present study, proposed scheme provides efficient energy utilization and management during the Dynamic DV-Hop localization method.  ...  Findings: The simulation work show that the proposed scheme decreases the total communication cost than the normal DV-Hop algorithm so in the proposed Dynamic DV-Hop method it represents less localization  ...  Communication Cost Each and every node in the network will broadcast an average of hop count packets and each node in the network is considered to have an average of neighbours.  ... 
doi:10.17485/ijst/2016/v9i30/88506 fatcat:qlxjpkk77bhqbngqn3nvjq7ky4

Improved Energy and Communication for Underwater Wireless Sensor Network Based Location Estimation

Priyanka Jain
2021 International Journal for Research in Applied Science and Engineering Technology  
In wireless sensor networks, knowing the position of a specific device in the network is a critical challenge. Many wireless systems require location information from mobile nodes.  ...  A sensor network consists of several nodes that are low in cost and have a battery with low capacity.  ...  In section Boyu Diao et. al.(3)"Depth-Based Routing for Underwater Sensor Networks: Improving Energy and Time Efficiency" In this paper, the author focuses on increasing the energy and time efficiency  ... 
doi:10.22214/ijraset.2021.38401 fatcat:gmmf6a7xbvaxdjargqq2xaxebu

Retrospection on Localization Techniques for Positioning Nodes in Wireless Sensor Networks

2020 International Journal of Engineering and Advanced Technology  
Wireless Sensor Networks have highly scattered, self-organized nodes that can detect, compute, and transmit the information collected at different nodes in the network.  ...  Our work traces a compilation of all the dynamic research in sensor networks on localization techniques and emanates eminent understanding of it.  ...  It plays a vital role in divulging the power-efficient route to attain the network lifetime optimized.  ... 
doi:10.35940/ijeat.b3440.029320 fatcat:l4sdoeuhffervbmekp45gvhekm

An Effective Cuckoo Search Algorithm for Node Localization in Wireless Sensor Network

Jing Cheng, Linyuan Xia
2016 Sensors  
This is because there are few anchors for many unknown nodes within the communication range, and the network connectivity between sensor nodes is poor as the example illustrated in Figure 6a .  ...  This is because the network is not connected for many nodes, such as the example of network topology in Figure 6 . As communication range increases, average localization error decreases greatly.  ...  The convergence speed reflects the efficiency of the Figure 9 . 9 Network topology of sensor nodes, the (•) represents unknown nodes, the (+) represents anchor nodes and the (−) represents the communication  ... 
doi:10.3390/s16091390 pmid:27589756 pmcid:PMC5038668 fatcat:tsp6d7gh3nfirfo4zarnkpsomm

Energy Efficient Range-Free Localization Algorithm for Wireless Sensor Networks

Rekha Goyat, Mritunjay Kumar Rai, Gulshan Kumar, Rahul Saha, Tai-Hoon Kim
2019 Sensors  
In this paper, an energy-efficient localization algorithm is proposed for precise localization in wireless sensor networks (WSNs) and the process is accomplished in three steps.  ...  Secondly, the discovered one-hop unknown nodes are divided into two sets, i.e. unknown nodes with direct communication, and with indirect communication for energy efficiency.  ...  Unknown nodes in the network may be located at a far distance from beacon nodes within one-hop as shown in Figure 4 , where unknown node 3 is situated at the border far from B1 and direct communication  ... 
doi:10.3390/s19163603 fatcat:7yw6klzav5a7nkbbmv4su6ueci

A Comprehensive Study on Cluster Based Routing Protocols for Wireless Sensor Networks

C. Deepa, B. Latha
2016 Indian Journal of Science and Technology  
Findings: There are number of routing procedures have been discussed, to progress their performance in wireless networks.  ...  Background/Objectives: Wireless Sensor Networks (WSNs) have emerged as a new powerful tool and a rapidly growing technology, which consume a lesser amount of energy for processing and communication.  ...  Unlike traditional networks WSNs can communicate with one another using multi-hop wireless communication 17 .  ... 
doi:10.17485/ijst/2016/v9i42/101988 fatcat:fxnxv6uvlveynnhho2c2nl426i

Power Allocation for Multi-Relay Amplify-And-Forward Cooperative Networks

Sarmad Sohaib, Daniel K. C. So
2011 2011 IEEE International Conference on Communications (ICC)  
Multi-relay cooperative networks affected by Multiple Carrier Frequency Offsets (MCFO's), Multiple Timing Offsets (MTO's) and unknown channel gains are estimated by Maximum-Likelihood (ML) estimation and  ...  Orthogonal synchronization has been a major problem in Cooperative Orthogonal Frequency Division Multiplexing (CO-OFDM) under the influence of both carrier frequency offset and timing offset with unknown  ...  communication and efficient spectrum usage.  ... 
doi:10.1109/icc.2011.5963453 dblp:conf/icc/SohaibS11 fatcat:dz3zd2b745hetngfvfcuaxuija

Location-aware Beamforming for MIMO-enabled UAV Communications: An Unknown Input Observer Approach [article]

Alireza Mohammadi, Mehdi Rahmati, Hafiz Malik
2021 arXiv   pre-print
Numerous communications and networking challenges prevent deploying unmanned aerial vehicles (UAVs) in extreme environments where the existing wireless technologies are mainly ground-focused; and, as a  ...  The solution, which uses discrete-time unknown input observers (UIOs), reduces the joint target detection and communication complication notably by operating on the same device and performs reliably in  ...  Equations of Motion of the UAV Network. In this article, we use the dynamical model adopted by the UAV-based communications literature (see, e.g., [25] ).  ... 
arXiv:2111.10665v1 fatcat:mcz6kebvsbh77jemhaeipvzpme
« Previous Showing results 1 — 15 out of 359,258 results