Filters








3,608 Hits in 4.1 sec

Self-estimation of Neighborhood Density for Mobile Wireless Nodes [chapter]

Junji Hamada, Akira Uchiyama, Hirozumi Yamaguchi, Shinji Kusumoto, Teruo Higashino
2009 Lecture Notes in Computer Science  
In this paper, we propose a method to estimate the density of nodes for pedestrians and/or vehicles with information terminals.  ...  Also by estimating the change of the density, taking into account the movement characteristics of nodes, the density map is updated in a timely fashion.  ...  However, the proposed method is designed for mobile nodes to self-estimate their neighborhood density.  ... 
doi:10.1007/978-3-642-02830-4_15 fatcat:edv3fk6omjgrpg7exjyq4nb62m

NetDetect: Neighborhood Discovery in Wireless Networks Using Adaptive Beacons

Venkatraman Iyer, Andrei Pruteanu, Stefan Dulman
2011 2011 IEEE Fifth International Conference on Self-Adaptive and Self-Organizing Systems  
A major building block for enabling self-* system properties in ad-hoc scenarios is the run-time discovery of neighboring devices and somewhat equivalently, the estimation of the local node density.  ...  Results show that NetDetect performs well in all considered scenarios, maintaining a high rate of neighbor discoveries and good estimate of the neighborhood density even in very dynamic situations.  ...  We present the averaged results only for nodes having neighborhood densities of 20, 25 and 30 nodes.  ... 
doi:10.1109/saso.2011.14 dblp:conf/saso/IyerPD11 fatcat:22ekrsykefhcvowydie2zdlgqe

Self-Estimation of Neighborhood Distribution for Mobile Wireless Nodes

Yuki Sakai, Akira Uchiyama, Hirozumi Yamaguchi, Teruo Higashino
2013 Journal of Information Processing  
Each node also updates the density map in a timely fashion by estimating the change of the density due to node mobility.  ...  In this paper, we propose a method to estimate the node distribution for pedestrians with information terminals.  ...  However, the proposed method is designed for mobile nodes to self-estimate their neighborhood distribution.  ... 
doi:10.2197/ipsjjip.21.198 fatcat:je6simzp5ndx7patplcdercmqq

Big wireless measurement campaigns

Miguel Elias M. Campista, Marcelo D. de Amorim, Luís Henrique M.K. Costa
2012 Proceedings of the 4th ACM international workshop on Hot topics in planet-scale measurement - HotPlanet '12  
Performance evaluation of mobile wireless networking has to cope with two main issues: representativeness and feasibility.  ...  In a wireless network, the number of variables is potentially large and unexpected physical phenomena may occur at any time.  ...  For instance, measuring a node degree at a time instant can give a clue about the density of its location and what kind of relationship is established among the nodes in that area.  ... 
doi:10.1145/2307836.2307845 dblp:conf/mobisys/CampistaAC12 fatcat:ayzxem3iifg7jgq33lm4iwiyji

Designing WiMAX Static Environment using Local Automata based Autonomic Network Architecture for Wireless Sensor Networks

Sanjay K N, Shaila K, Venugopal K R
2021 Procedia Computer Science  
One method of solving the issue is to use local automate based environment for dynamic nodes.  ...  One method of solving the issue is to use local automate based environment for dynamic nodes.  ...  The architecture of ANA supports for Unicast and Multicast deliveries, Adaptability for environment, Self-Configuring with node failure.  ... 
doi:10.1016/j.procs.2021.04.017 fatcat:cdcfe52qrfcitlasej6sc4ug3y

Relative localization with 2-hop neighborhood

Christopher J. Mallery, Sirisha Medidi, Muralidhar Medidi
2008 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks  
Localization is the process in which nodes in a wireless sensor network self-determine their positions in the network.  ...  We propose ANIML an iterative, range-aware relative localization technique for wireless sensor networks that requires no anchor nodes.  ...  However, facing node mobility typical in MANETs, the estimated positions attempt to preserve inter-node distances in the local neighborhood and need not correlate with the physical network topology.  ... 
doi:10.1109/wowmom.2008.4594874 dblp:conf/wowmom/MalleryMM08 fatcat:iwphcwu5qzbzxc4mlhhnb2og4a

Analysis of the impact of hello protocol parameters over a wireless network self-organization

Tahiry Razafindralambo, Nathalie Mitton
2007 Proceedings of the 4th ACM workshop on Performance evaluation of wireless ad hoc, sensor,and ubiquitous networks - PE-WASUN '07  
The neighborhood discovery and its maintenance are very important in wireless networks for any applications, especially for routing and every self- * algorithm.  ...  Neighbor nodes are usually discovered thanks to the use of the HELLO protocol. This makes this HELLO protocol very important for wireless networks especially for selforganizing the network.  ...  This metric can be for instance the node identifier [9, 1] , the node degree [10, 6, 15] , a mobility value [2] , a balanced sum of all of them [4] or a link density value [12] .  ... 
doi:10.1145/1298197.1298206 dblp:conf/pe-wasun/RazafindralamboM07 fatcat:ou6esbgzhvaxpj3mg5rlmw7znu

Directional maximum likelihood self-estimation of the path-loss exponent

Yongchang Hu, Geert Leus
2016 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)  
In this paper, we are the first to introduce two directional maximum likelihood (ML) self-estimators for the PLE in wireless networks.  ...  Most existing methods for estimating the PLE not only require nodes with known locations but also assume an omni-directional PLE.  ...  Proposed ML self-estimator Proposed ML self-estimator using P (1) and P (n) CRLB (c) First simulation: impact of the PLE when the node density is set to 1 nodes/m 2 .  ... 
doi:10.1109/icassp.2016.7472389 dblp:conf/icassp/HuL16 fatcat:5rb6z2jki5eb3a6v3omj4g5o6i

Secure neighborhood discovery: a fundamental element for mobile ad hoc networking

Panos Papadimitratos, Marcin Poturalski, Patrick Schaller, Pascal Lafourcade, David Basin, Srdjan Capkun, Jean-Pierre Hubaux
2008 IEEE Communications Magazine  
Coping with mobility and the volatility of wireless communications in such systems is critical.  ...  Neighborhood Discovery (ND), namely, the discovery of devices directly reachable for communication or in physical proximity, becomes a fundamental requirement and a building block for various applications  ...  Protocols for Neighborhood Discovery (ND) serve as fundamental building blocks in mobile wireless systems.  ... 
doi:10.1109/mcom.2008.4473095 fatcat:ymdyqrays5bqxbjfsfnjjaaa2u

Distributed multicast group security architecture for mobile ad hoc networks

Jiejun Kong, Yeng-zhong Lee, M. Gerla
2006 IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006.  
in network topology, node density and node mobility.  ...  mobile backbone nodes in MANET.  ...  The autonomous choice of k is based on the node's self-estimation of local density (which can be acquired from an existing secure neighborhood detection algorithm [11] ).  ... 
doi:10.1109/wcnc.2006.1683544 dblp:conf/wcnc/KongLG06 fatcat:5tguoahvkfebpe6eb2mfrmsvai

Revisiting Gossip-Based Ad-Hoc Routing

Albana Gaba, Spyros Voulgaris, Konrad Iwanicki, Maarten van Steen
2012 2012 21st International Conference on Computer Communications and Networks (ICCCN)  
First, we perform an extensive experimental evaluation of GOSSIP3 under fully utilized wireless channel and across diverse node densities.  ...  Second, we devise a self-configuration algorithm for GOSSIP3 that allows the protocol to work optimally for any network.  ...  ACKNOWLEDGMENTS This work was partially supported by the Foundation for Polish Science under grant HOMING PLUS/2010-2/4, co-financed from the Regional Development Fund of the European Union within the  ... 
doi:10.1109/icccn.2012.6289312 dblp:conf/icccn/GabaVIS12 fatcat:peushbpkpfaepof6uvknwbryoe

On Selecting Nodes to Improve Estimated Positions [chapter]

Erwan Ermel, Anne Fladenmuller, Guy Pujolle, André Cotton
2005 IFIP International Federation for Information Processing  
We consider node localization problems in ad hoc wireless networks in which two types of nodes are considered: nodes with self-locating capability like GPS and nodes with no self-locating capability.  ...  Our simple algorithm for improving the position accuracy consists of selecting and processing only the nodes that are likely to enhance the position estimation.  ...  For instance, due to the unpredictable mobility of nodes, the network topology is inherently unstable.  ... 
doi:10.1007/0-387-23150-1_38 fatcat:snwe5e5dwvf7ribkbds53grtqi

A Self-Organization Framework for Wireless Ad Hoc Networks as Small Worlds

Abhik Banerjee, Rachit Agarwal, Vincent Gauthier, Chai Kiat Yeo, Hossam Afifi, Francis Bu-Sung Lee
2012 IEEE Transactions on Vehicular Technology  
Motivated by the benefits of small world networks, we propose a self-organization framework for wireless ad hoc networks.  ...  We define a new centrality measure that estimates the structural importance of nodes based on traffic flow in the network, which is used to identify the optimum nodes for beamforming.  ...  For our problem of distributed self-organization of the network, we need nodes to accurately estimate their importance with respect to paths in the network.  ... 
doi:10.1109/tvt.2012.2197768 fatcat:vievzeurrbdjdhdwyyz2675p4a

Energy aware self-organizing density management in wireless sensor networks

Erwan Le Merrer, Vincent Gramoli, Anne-Marie Kermarrec, Aline C. Viana, Marin Bertier
2006 Proceedings of the 1st international workshop on Decentralized resource sharing in mobile computing and networking - MobiShare '06  
Simulation results show that, though slightly increasing path lengths from sensor to sink nodes, the proposed scheme improves significantly the network lifetime for different neighborhood densities degrees  ...  We propose a simple and adaptive energy-conserving topology management scheme, called SAND (Self-Organizing Active Node Density).  ...  On the other hand, despite the increase of the rate of forwarding nodes over the total number of nodes, the number of forwarding nodes becomes almost constant for higher neighborhood densities (e.g., for  ... 
doi:10.1145/1161252.1161259 dblp:conf/mobicom/MerrerGKVB06 fatcat:hnm34foeq5gqnhbfko7mqf3ku4

Dynamic multi-hop clustering for mobile hybrid wireless networks

Matthias R. Brust, Hannes Frey, Steffen Rothkugel
2008 Proceedings of the 2nd international conference on Ubiquitous information management and communication - ICUIMC '08  
While the dynamicity of mobile wireless ne tw o rk is o fte n c o nside red as a c h a llen g e , in th is w o rk w e explicitly exploit node mobility in order to support cluster formation and maintenance  ...  In mobile wireless networks communication is often improved by sending messages along a stable backbone of more reliable communication paths.  ...  Assuming a uniform node distribution the average network density , i.e. expected number of nodes in a node's sending range including the node itself, can roughly be estimated as .  ... 
doi:10.1145/1352793.1352820 dblp:conf/icuimc/BrustFR08 fatcat:i2ktbhegkbe5dcirsosvzv6qiq
« Previous Showing results 1 — 15 out of 3,608 results