Small world routing: a methodological framework for driving the emerging topology of energy-constrained multi-hop wireless networks

2006 ◽  
Author(s):  
L. De Nardis ◽  
M. Di Benedetto
Keyword(s):  
Wireless Networks ◽  
Small World ◽  
Methodological Framework ◽  
Energy Constrained

scholarly journals Multicast time maximization in energy constrained wireless networks

2003 ◽  
Author(s):  
Patrik Flor?en ◽  
Petteri Kaski ◽  
Jukka Kohonen ◽  
Pekka Orponen
Keyword(s):  
Wireless Networks ◽  
Energy Constrained

Optimization decomposition in energy-constrained wireless networks

Optimization ◽  
2009 ◽  
Vol 58 (7) ◽  
pp. 845-859 ◽  
Author(s):  
Won-Joo Hwang ◽  
Reizel Casaquite ◽  
Bazarragchaa Barsbold ◽  
Rentsen Enkhbat
Keyword(s):  
Wireless Networks ◽  
Energy Constrained

On the Topology Design of Integrated Wireless Networks

2011 ◽  
Vol 55-57 ◽  
pp. 555-560
Author(s):  
Xin Yan ◽  
Jia Gen Du
Keyword(s):  
Wireless Networks ◽  
Communication Networks ◽  
Topology Control ◽  
Preferential Attachment ◽  
Small World ◽  
Topology Design ◽  
Relay Nodes ◽  
Time Step ◽  
Scale Free ◽  
Proximity Graph

Topology clustering, constructing overlay graphs, adding relay nodes, or creating a “small-world” network by building some shortcuts etc, topology control schemes are able to achieve the scalability, resilience, and fault-tolerance for wireless communication networks. In this article, we take a different approach to reach such aim for heterogeneous integrated wireless networks by generating a topology such that the resulting network is “scale-free”. Thereby we propose a topology control algorithm based on the “scale-free” complex network concept and directed proximity graph theory for integrated wireless networks with non-uniform transmission ranges. In this algorithm, the topology is also generated by new nodes’ growth and preferential attachment procedure, but where each new node connects to the existing nodes in its directed attachable proximity in terms of certain probability at each time step. Each node’s directed attachable proximity graph is generated from its directed reachable proximity graph that is built by regulating its transmission power based on locally collected information. The simulation experiments are provided to validate our claims.

scholarly journals Adaptive In-Network Processing for Bandwidth and Energy Constrained Mission-Oriented Multi-hop Wireless Networks

2009 ◽  
pp. 87-102 ◽  
Author(s):  
Sharanya Eswaran ◽  
Matthew Johnson ◽  
Archan Misra ◽  
Thomas La Porta
Keyword(s):  
Wireless Networks ◽  
Energy Constrained ◽  
Network Processing
Sign in / Sign up

Export Citation Format

Share Document