WINET
2010
13 years 9 months ago
2010
In Universal Mobile Telecommunication System (UMTS), the downlink capacity is limited by the base station transmission power. Therefore, power control plays an important role to mi...
WINET
2010
13 years 9 months ago
2010
Fair scheduling is an ideal candidate for fair bandwidth sharing and thereby achieving fairness among the contending flows in a network. It is particularly challenging for ad hoc ...
WINET
2010
13 years 9 months ago
2010
Connectivity in wireless ad hoc and sensor networks is typically analyzed using a graph-theoretic approach. In this paper, we investigate an alternative communication-theoretic app...
WINET
2010
13 years 9 months ago
2010
Due to complicated situations such as node/link interference and traffic load, quality of service support in multi-hop multi-rate ad hoc networks remains a challenging issue. Furt...
WINET
2010
13 years 9 months ago
2010
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...
WINET
2010
13 years 9 months ago
2010
In this paper, we present a model that estimates the time duration of routes formed by several intermediate nodes in mobile multi-hop ad-hoc networks. First, we analyze a 3-node ro...
WINET
2010
13 years 9 months ago
2010
Abstract Link Adaptation is a radio resource management technique that assesses the channel conditions and selects a transport mode, from a set of possible options, which is optimi...
WINET
2010
13 years 9 months ago
2010
Wireless sensor networks comprise typically dense deployments of large networks of small wireless capable sensor devices. In such networks, multicast is a fundamental routing servi...
WINET
2010
13 years 9 months ago
2010
Abstract. Fault-tolerant communication and energy efficiency are important requirements for future-generation wireless ad hoc networks, which are increasingly being considered also...
WINET
2010
13 years 9 months ago
2010
We study routing algorithms for three-dimensional ad hoc networks that guarantee delivery and are k-local, i.e., each intermediate node v’s routing decision only depends on knowl...