Filters








306 Hits in 5.1 sec

A novel family of geometric planar graphs for wireless ad hoc networks

Xu Li, Nathalie Mitton, Isabelle Simplot-Ryl, David Simplot-Ryl
2011 2011 Proceedings IEEE INFOCOM  
We present a construction algorithm for these graphs and analyze its time complexity. Hypocomb family graphs are promising for wireless ad hoc networking.  ...  We propose a radically new family of geometric graphs, i.e., Hypocomb, Reduced Hypocomb and Local Hypocomb.  ...  It may serve as alternative graph in geographic routing for providing delivery guarantee in wireless ad hoc networks.  ... 
doi:10.1109/infcom.2011.5934997 dblp:conf/infocom/LiMSS11 fatcat:xfwqy3nvqrdizlwyz2tntucwhu

Hypocomb: Bounded-Degree Localized Geometric Planar Graphs for Wireless Ad Hoc Networks

Xu Li, Nathalie Mitton, Isabelle Simplot-Ryl, David Simplot-Ryl
2013 IEEE Transactions on Parallel and Distributed Systems  
We present a construction algorithm for these graphs and analyze its time complexity. Hypocomb family graphs are promising for wireless ad hoc networking.  ...  We propose a radically new family of geometric graphs, i.e., Hypocomb (HC), Reduced Hypocomb (RHC) and Local Hypocomb (LHC).  ...  It may serve as alternative graph in geographic routing for providing delivery guarantee in wireless ad hoc networks.  ... 
doi:10.1109/tpds.2012.180 fatcat:3mqxknhktvd4tbygjartooqg4i

Geographic and Energy-Aware Routing in Sensor Networks [chapter]

Hannes Frey, Ivan Stojmenović
2005 Handbook of Sensor Networks  
Geometric ad-hoc routing: Of theory and practice.  ...  Ad-hoc networks beyond unit disk graphs.  ... 
doi:10.1002/047174414x.ch12 fatcat:q44iwumcxzhonftzf5slwytl7a

A Survey on Three-Dimensional Wireless Ad Hoc and Sensor Networks

Babar Shah, Ki-Il Kim
2014 International Journal of Distributed Sensor Networks  
To achieve this, the survey is organized according to two good example networks, airborne ad hoc networks (AANETs) and underwater wireless sensor networks (UWSNs).  ...  In parallel with steady research and development in ad hoc and wireless sensor networks, many testbeds have been implemented and deployed in real world.  ...  In this paper, 3D wireless ad hoc network, AANETs, and 3D wireless sensor network, UWSNs, are surveyed as a separate network family for efficient communication.  ... 
doi:10.1155/2014/616014 fatcat:vn7yopaoqbcvzk2uhjlbnhfw3m

Network Topology Models for Multihop Wireless Networks

András Faragó
2012 ISRN Communications and Networking  
At the same time, extensive and rapidly growing wireless ad hoc and sensor networks also lead to hard topology modeling questions.  ...  A typical feature of huge, random network topologies is that they are too large to allow a fully detailed description.  ...  Acknowledgment The author gratefully acknowledges the support of NSF Grant no. CNS-1018760.  ... 
doi:10.5402/2012/362603 fatcat:2p5hoizi3vhdlapazdp7ygp7ge

Topology Control in Wireless AD HOC Networks [chapter]

Xiang-Yang Li
2005 Mobile Ad Hoc Networking  
Sanders, for his supervision, encouragement and support. I am very privileged to work with him.  ...  for wireless ad hoc networks.  ...  Modelling Wireless Ad hoc Networks At any instant of time, a wireless ad hoc network can be modelled as a graph, often called the communication graph, G = (V , E) where the elements of V are the network  ... 
doi:10.1002/0471656895.ch6 fatcat:6wp57pycuzcgtf35qz23kuowkm

Applications of k-local MST for topology control and broadcasting in wireless ad hoc networks

Xiang-Yang Li, Yu Wang, Wen-Zhan Song
2004 IEEE Transactions on Parallel and Distributed Systems  
In this paper, we propose a family of structures, namely, k-localized minimum spanning tree (LMST k ) for topology control and broadcasting in wireless ad hoc networks.  ...  Firstly, we propose a family of structures, namely, k-localized minimum spanning tree (LMST k ) for topology control and broadcasting in wireless ad hoc networks.  ...  INTRODUCTION We consider a wireless ad hoc network composed of n wireless devices (called nodes hereafter) distributed in a two-dimensional plane.  ... 
doi:10.1109/tpds.2004.77 fatcat:52vwu4jxzvhj7ddz4sikvnn74i

On a Conjecture Related to Geometric Routing [chapter]

Christos H. Papadimitriou, David Ratajczak
2004 Lecture Notes in Computer Science  
A consequence of this conjecture would be that in any ad hoc network containing such a graph as a spanning subgraph, two-dimensional virtual coordinates for the nodes can be found for which the method  ...  We also present a simple but provably robust version of greedy routing that works for any graph with a 3-connected planar spanning subgraph.  ...  We also thank the anonymous reviewers for their helpful comments.  ... 
doi:10.1007/978-3-540-27820-7_3 fatcat:jgle7mcclfdl7f6ishi4mb5bni

On a conjecture related to geometric routing

Christos H. Papadimitriou, David Ratajczak
2005 Theoretical Computer Science  
A consequence of this conjecture would be that in any ad hoc network containing such a graph as a spanning subgraph, two-dimensional virtual coordinates for the nodes can be found for which the method  ...  We also present a simple but provably robust version of greedy routing that works for any graph with a 3-connected planar spanning subgraph.  ...  We also thank the anonymous reviewers for their helpful comments.  ... 
doi:10.1016/j.tcs.2005.06.022 fatcat:7ihk3jbhlnhaddyernomqhph3i

G-STAR: Geometric STAteless Routing for 3-D wireless sensor networks

Min-Te Sun, Kazuya Sakai, Benjamin R. Hamilton, Wei-Shinn Ku, Xiaoli Ma
2011 Ad hoc networks  
In this paper, we propose a novel routing protocol, namely Geometric STAteless Routing (G-STAR) for 3-D networks.  ...  We conclude that the proposed protocols serve as a strong candidate for future high-dimensional sensor networks.  ...  VRR [18] and VCP [19] use a distributed hash table (DHT) to create an overlay network topology in ad hoc networks.  ... 
doi:10.1016/j.adhoc.2010.07.013 fatcat:wn2c4jplmbfshdpu2q3ulnl4pe

Greedy Routing with Bounded Stretch

R. Flury, S. V. Pemmaraju, R. Wattenhofer
2009 IEEE INFOCOM 2009 - The 28th Conference on Computer Communications  
We do this by extending the celebrated Lipton-Tarjan separator theorem for planar graphs to CUDGs.  ...  To the best of our knowledge, this is the first greedy embedding with stretch guarantees for this class of networks.  ...  This debate is at the fore-front in the community that studies infrastructure-less networks, e.g. wireless sensor networks, mesh networks, or mobile ad hoc networks, where many of these upcoming Internet  ... 
doi:10.1109/infcom.2009.5062093 dblp:conf/infocom/FluryPW09 fatcat:vswckiggwbgbxei6cqs6jcex5e

Improving Routing Efficiency through Intermediate Target Based Geographic Routing [article]

Zongming Fei, Jianjun Yang, Hui Lu
2015 arXiv   pre-print
We design an efficient method for the source to find out whether a destination node belongs to a shaded area.  ...  The novelty of the approach is that a single forwarding path can be used to determine a shaded area that may cover many destination nodes.  ...  Also related is GLR, a geographic routing scheme for large wireless ad hoc networks [25] .  ... 
arXiv:1502.04316v1 fatcat:q6hqruynobbsxgxox7crjb6zoi

Bridging Socially Enhanced Virtual Communities

Venugopal Rao
2013 IOSR Journal of Computer Engineering  
The architecture of the proposed system is compromising of human activities and also automated activities and it is essentially a service oriented system.  ...  For the purpose of bringing the previously separated groups and also finding new relevant groups we introduced broker discovery concept that makes use of techniques and metrics pertaining to interactive  ...  His suggestion about wireless networks in MANETs during the project was essential to the project's success.  ... 
doi:10.9790/0661-0940104 fatcat:zejgpenvqzb7rkchkznv5igfwm

Improving routing efficiency through intermediate target based geographic routing

Zongming Fei, Jianjun Yang, Hui Lu
2015 Digital Communications and Networks  
We design an efficient method for the source to find out whether a destination node belongs to a shaded area.  ...  The novelty of the approach is that a single forwarding path can be used to determine a shaded area that may cover many destination nodes.  ...  The views and opinions of the authors expressed herein do not necessarily state or reflect those of the United States Government or any agency thereof, nor of the University of Central Florida or any agency  ... 
doi:10.1016/j.dcan.2015.07.001 fatcat:k4g5m35c65gmzd7cjui7leb6t4

Energy-Aware Georouting with Guaranteed Delivery in Wireless Sensor Networks with Obstacles

Essia Hamouda, Nathalie Mitton, Bogdan Pavkovic, David Simplot-Ryl
2009 International Journal of Wireless Information Networks  
We propose, EtE, a novel end-to-end localized routing protocol for wireless sensor networks that is energy-efficient and guarantees delivery.  ...  First, it builds a connected dominating set from graph G, second it computes its Gabriel graph to obtain the planar graph G ′ .  ...  Acknowledgments This research was partially supported by NSERC Canada, a grant from CPER Nord-Pas-de-Calais/FEDER TAC COMDOM, from an INRIA ARC program CARMA and from the French National Research Agency  ... 
doi:10.1007/s10776-009-0105-1 fatcat:llx4wpm5e5gfpb7wa5ydptqdma
« Previous Showing results 1 — 15 out of 306 results