Results 1  10
of
12,427
A Survey on Sensor Networks
, 2002
"... Recent advancement in wireless communica tions and electronics has enabled the develop ment of lowcost sensor networks. The sensor networks can be used for various application areas (e.g., health, military, home). For different application areas, there are different technical issues that research ..."
Abstract

Cited by 2002 (1 self)
 Add to MetaCart
Recent advancement in wireless communica tions and electronics has enabled the develop ment of lowcost sensor networks. The sensor networks can be used for various application areas (e.g., health, military, home). For different application areas, there are different technical issues
Critical Power for Asymptotic Connectivity in Wireless Networks
, 1998
"... : In wireless data networks each transmitter's power needs to be high enough to reach the intended receivers, while generating minimum interference on other receivers sharing the same channel. In particular, if the nodes in the network are assumed to cooperate in routing each others ' pack ..."
Abstract

Cited by 541 (19 self)
 Add to MetaCart
as the number of nodes in the network goes to infinity. It is shown that if n nodes are placed in a disc of unit area in ! 2 and each node transmits at a power level so as to cover an area of ßr 2 = (log n + c(n))=n, then the resulting network is asymptotically connected with probability one if and only
Performance Analysis of the IEEE 802.11 Distributed Coordination Function
, 2000
"... Recently, the IEEE has standardized the 802.11 protocol for Wireless Local Area Networks. The primary medium access control (MAC) technique of 802.11 is called distributed coordination function (DCF). DCF is a carrier sense multiple access with collision avoidance (CSMA/CA) scheme with binary slott ..."
Abstract

Cited by 1869 (1 self)
 Add to MetaCart
Recently, the IEEE has standardized the 802.11 protocol for Wireless Local Area Networks. The primary medium access control (MAC) technique of 802.11 is called distributed coordination function (DCF). DCF is a carrier sense multiple access with collision avoidance (CSMA/CA) scheme with binary
Algebraic Graph Theory
, 2011
"... Algebraic graph theory comprises both the study of algebraic objects arising in connection with graphs, for example, automorphism groups of graphs along with the use of algebraic tools to establish interesting properties of combinatorial objects. One of the oldest themes in the area is the investiga ..."
Abstract

Cited by 892 (13 self)
 Add to MetaCart
Algebraic graph theory comprises both the study of algebraic objects arising in connection with graphs, for example, automorphism groups of graphs along with the use of algebraic tools to establish interesting properties of combinatorial objects. One of the oldest themes in the area
The capacity of wireless networks
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2000
"... When n identical randomly located nodes, each capable of transmitting at bits per second and using a fixed range, form a wireless network, the throughput @ A obtainable by each node for a randomly chosen destination is 2 bits per second under a noninterference protocol. If the nodes are optimally p ..."
Abstract

Cited by 3243 (42 self)
 Add to MetaCart
When n identical randomly located nodes, each capable of transmitting at bits per second and using a fixed range, form a wireless network, the throughput @ A obtainable by each node for a randomly chosen destination is 2 bits per second under a noninterference protocol. If the nodes are optimally
MaxProp: Routing for VehicleBased DisruptionTolerant Networks
 In Proc. IEEE INFOCOM
, 2006
"... Abstract — Disruptiontolerant networks (DTNs) attempt to route network messages via intermittently connected nodes. Routing in such environments is difficult because peers have little information about the state of the partitioned network and transfer opportunities between peers are of limited dura ..."
Abstract

Cited by 488 (12 self)
 Add to MetaCart
duration. In this paper, we propose MaxProp, a protocol for effective routing of DTN messages. MaxProp is based on prioritizing both the schedule of packets transmitted to other peers and the schedule of packets to be dropped. These priorities are based on the path likelihoods to peers according
Performance Anomaly of 802.11b
 In IEEE INFOCOM
, 2003
"... Abstract — We analyze the performance of the IEEE 802.11b wireless local area networks. We have observed that when some mobile hosts use a lower bit rate than the others, the performance of all hosts is considerably degraded. Such a situation is a common case in wireless local area networks in which ..."
Abstract

Cited by 431 (11 self)
 Add to MetaCart
Abstract — We analyze the performance of the IEEE 802.11b wireless local area networks. We have observed that when some mobile hosts use a lower bit rate than the others, the performance of all hosts is considerably degraded. Such a situation is a common case in wireless local area networks
Multiuser OFDM with Adaptive Subcarrier, Bit, and Power Allocation
 IEEE JOURNAL ON SELECTED AREAS OF COMMUNICATIONS
, 1999
"... Multiuser orthogonal frequency division multiplexing (OFDM) with adaptive multiuser subcarrier allocation and adaptive modulation is considered. Assuming knowledge of the instantaneous channel gains for all users, we propose a multiuser OFDM subcarrier, bit, and power allocation algorithm to minimiz ..."
Abstract

Cited by 360 (3 self)
 Add to MetaCart
allocation schemes. We have also quantified the improvement in terms of the overall required transmit power, the biterror rate (BER), or the area of coverage for a given outage probability.
Semistructured data
, 1997
"... In semistructured data, the information that is normally associated with a schema is contained within the data, which is sometimes called “selfdescribing”. In some forms of semistructured data there is no separate schema, in others it exists but only places loose constraints on the data. Semistr ..."
Abstract

Cited by 281 (0 self)
 Add to MetaCart
to represent and query data that do not completely fit with conventional data models. The purpose of this tutorial is to to describe this motivation and to suggest areas in which further research may be fruitful. For a similar exposition, the reader is referred to Serge Abiteboul’s recent survey paper PI
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks
, 2007
"... n source and destination pairs randomly located in an area want to communicate with each other. Signals transmitted from one user to another at distance r apart are subject to a power loss of r −α as well as a random phase. We identify the scaling laws of the information theoretic capacity of the ne ..."
Abstract

Cited by 263 (18 self)
 Add to MetaCart
n source and destination pairs randomly located in an area want to communicate with each other. Signals transmitted from one user to another at distance r apart are subject to a power loss of r −α as well as a random phase. We identify the scaling laws of the information theoretic capacity
Results 1  10
of
12,427