Sciweavers

JPDC
2008
128views more  JPDC 2008»
13 years 11 months ago
An interference-aware fair scheduling for multicast in wireless mesh networks
Multicast is a fundamental routing service in wireless mesh networks (WMNs) due to its many potential applications such as video conferencing, online games, and webcast. Recently,...
Dimitrios Koutsonikolas, Saumitra M. Das, Y. Charl...
JNW
2008
115views more  JNW 2008»
13 years 11 months ago
On the Interaction Between Multiple Paths and Wireless Mesh Networks Scheduler Approaches
Multi-path routing allows building and use of multiple paths for routing between a source-destination pair. This paper investigates the problem of selecting multiple routing paths ...
Valeria Loscrì
JNW
2008
144views more  JNW 2008»
13 years 11 months ago
Low-Latency Geographic Routing for Asynchronous Energy-Harvesting WSNs
Research on data routing strategies for wireless sensor networks (WSNs) has largely focused on energy efficiency. However rapid advances in WSNs require routing protocols which can...
Donggeon Noh, Ikjune Yoon, Heonshik Shin
JNW
2008
124views more  JNW 2008»
13 years 11 months ago
A Position Based Ant Colony Routing Algorithm for Mobile Ad-hoc Networks
Position based routing algorithms use the knowledge of the position of nodes for routing of packets in mobile ad-hoc networks. Previously proposed position based routing algorithms...
Shahab Kamali, Jaroslav Opatrny
CORR
2007
Springer
72views Education» more  CORR 2007»
13 years 11 months ago
A Heuristic Routing Mechanism Using a New Addressing Scheme
Current methods of routing are based on network information in the form of routing tables, in which routing protocols determine how to update the tables according to the network ch...
Mohsen Ravanbakhsh, Yasin Abbasi-Yadkori, Maghsoud...
CORR
2007
Springer
92views Education» more  CORR 2007»
13 years 11 months ago
Throughput Scaling in Random Wireless Networks: A Non-Hierarchical Multipath Routing Strategy
— Franceschetti et al. [1] have recently shown that per-node throughput in an extended (i.e., geographically expanding), ad hoc wireless network with Θ(n) randomly distributed n...
Awlok Josan, Mingyan Liu, David L. Neuhoff, S. San...
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 11 months ago
On Compact Routing for the Internet
The Internet’s routing system is facing stresses due to its poor fundamental scaling properties. Compact routing is a research field that studies fundamental limits of routing ...
Dmitri V. Krioukov, Kimberly C. Claffy, Kevin R. F...
JCST
2008
203views more  JCST 2008»
13 years 11 months ago
Scoped Bellman-Ford Geographic Routing for Large Dynamic Wireless Sensor Networks
Routing is a fundamental problem in wireless sensor networks. Most previous routing protocols are challenged when used in large dynamic networks as they suffer from either poor sca...
Xue Zhang, Jue Hong, Sanglu Lu, Li Xie, Jiannong C...
JCST
2008
144views more  JCST 2008»
13 years 11 months ago
Beacon-Less Geographic Routing in Real Wireless Sensor Networks
Geographic Routing (GR) algorithms, require nodes to periodically transmit HELLO messages to allow neighbors know their positions (beaconing mechanism). Beacon-less routing algorit...
Juan A. Sánchez, Rafael Marín-P&eacu...
INFORMATICALT
2006
116views more  INFORMATICALT 2006»
13 years 11 months ago
An Agent-Based Best Effort Routing Technique for Load Balancing
Abstract. Several best effort schemes (next-hop routing) are used to transport the data in the Internet. Some of them do not perform flexible route computations to cope up with the...
Sunilkumar S. Manvi, Pallapa Venkataram