• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 3,802
Next 10 →

Protocols for self-organization of a wireless sensor network

by Katayoun Sohrabi, Jay Gao, Vishal Ailawadhi, Gregory J Pottie - IEEE Personal Communications , 2000
"... We present a suite of algorithms for self-organization of wireless sensor networks, in which there is a scalably large number of mainly static nodes with highly constrained energy resources. The protocols further support slow mobility by a subset of the nodes, energy-efficient routing, and formation ..."
Abstract - Cited by 536 (5 self) - Add to MetaCart
We present a suite of algorithms for self-organization of wireless sensor networks, in which there is a scalably large number of mainly static nodes with highly constrained energy resources. The protocols further support slow mobility by a subset of the nodes, energy-efficient routing

Minimum energy mobile wireless networks

by Volkan Rodoplu, Teresa H. Meng - IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS , 1999
"... We describe a distributed position-based network protocol optimized for minimum energy consumption in mobile wireless networks that support peer-to-peer communications. Given any number of randomly deployed nodes over an area, we illustrate that a simple local optimization scheme executed at each n ..."
Abstract - Cited by 749 (0 self) - Add to MetaCart
We describe a distributed position-based network protocol optimized for minimum energy consumption in mobile wireless networks that support peer-to-peer communications. Given any number of randomly deployed nodes over an area, we illustrate that a simple local optimization scheme executed at each

I-TCP: Indirect TCP for mobile hosts

by Ajay Bakre, B. R. Badrinath , 1995
"... Abstract — IP-based solutions to accommodate mobile hosts within existing internetworks do not address the distinctive features of wireless mobile computing. IP-based transport protocols thus suffer from poor performance when a mobile host communicates with a host on the fixed network. This is cause ..."
Abstract - Cited by 614 (7 self) - Add to MetaCart
. This is caused by frequent disruptions in network layer connectivity due to — i) mobility and ii) unreliable nature of the wireless link. We describe the design and implementation of I-TCP, which is an indirect transport layer protocol for mobile hosts. I-TCP utilizes the resources of Mobility Support Routers

Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers

by Charles E. Perkins, Pravin Bhagwat , 1994
"... An ad-hoc network is the cooperative engagement of a collection of Mobile Hosts without the required intervention of any centralized Access Point. In this paper we present an innovative design for the operation of such ad-hoc networks. The basic idea of the design is to operate each Mobile Host as a ..."
Abstract - Cited by 2076 (8 self) - Add to MetaCart
as a specialized router, which periodically advertises its view of the interconnection topology with other Mobile Hosts within the network. This amounts to a new sort of routing protocol. We have investigated modifications to the basic Bellman-Ford routing mechanisms, as specified by RIP [5], to make

SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks

by Yih-Chun Hu, David B. Johnson, Adrian Perrig , 2003
"... An ad hoc network is a collection of wireless computers (nodes), communicating among themselves over possibly multihop paths, without the help of any infrastructure such as base stations or access points. Although many previous ad hoc network routing protocols have been based in part on distance vec ..."
Abstract - Cited by 534 (8 self) - Add to MetaCart
An ad hoc network is a collection of wireless computers (nodes), communicating among themselves over possibly multihop paths, without the help of any infrastructure such as base stations or access points. Although many previous ad hoc network routing protocols have been based in part on distance

Managing Update Conflicts in Bayou, a Weakly Connected Replicated Storage System

by Douglas Terry, Marvin Theimer, Karin Petersen, Alan Demers, Mike Spreitzer, Carl Hauser - In Proceedings of the Fifteenth ACM Symposium on Operating Systems Principles , 1995
"... Bayou is a replicated, weakly consistent storage system designed for a mobile computing environment that includes portable machines with less than ideal network connectivity. To maximize availability, users can read and write any accessible replica. Bayou's design has focused on supporting apph ..."
Abstract - Cited by 512 (16 self) - Add to MetaCart
Bayou is a replicated, weakly consistent storage system designed for a mobile computing environment that includes portable machines with less than ideal network connectivity. To maximize availability, users can read and write any accessible replica. Bayou's design has focused on supporting

Internet Indirection Infrastructure

by Ion Stoica, Daniel Adkins, Shelley Zhuang, Scott Shenker, Sonesh Surana - In Proceedings of ACM SIGCOMM , 2002
"... Attempts to generalize the Internet's point-to-point communication abstraction to provide services like multicast, anycast, and mobility have faced challenging technical problems and deployment barriers. To ease the deployment of such services, this paper proposes an overlay-based Internet Indi ..."
Abstract - Cited by 396 (26 self) - Add to MetaCart
the act of sending from the act of receiving, and allows i3 to efficiently support a wide variety of fundamental communication services. To demonstrate the feasibility of this approach, we have designed and built a prototype based on the Chord lookup protocol.

Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks

by C.-K. Toh , 2001
"... Most ad hoc mobile devices today operate on batteries. Hence, power consumption becomes an important issue. To maximize the lifetime of ad hoc mobile networks, the power consumption rate of each node must be evenly distributed, and the overall transmission power for each connection request mus ..."
Abstract - Cited by 338 (0 self) - Add to MetaCart
Most ad hoc mobile devices today operate on batteries. Hence, power consumption becomes an important issue. To maximize the lifetime of ad hoc mobile networks, the power consumption rate of each node must be evenly distributed, and the overall transmission power for each connection request

Routing in Ad Hoc Networks of Mobile Hosts

by David B. Johnson - Proceedings of the Workshop on Mobile Computing Systems and Applications, IEEE Computer Society , 1581
"... An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any centralized administration or standard support services. In such an environment, it may be necessary for one mobile host to enlist the aid of others in forwarding a packet to its destination ..."
Abstract - Cited by 308 (18 self) - Add to MetaCart
An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any centralized administration or standard support services. In such an environment, it may be necessary for one mobile host to enlist the aid of others in forwarding a packet to its

Comparison of routing metrics for static multi-hop wireless networks

by Richard Draves, Jitendra Padhye, Brian Zill - In ACM SIGCOMM , 2004
"... Routing protocols for wireless ad hoc networks have traditionally focused on finding paths with minimum hop count. However, such paths can include slow or lossy links, leading to poor throughput. A routing algorithm can select better paths by explicitly taking the quality of the wireless links into ..."
Abstract - Cited by 331 (3 self) - Add to MetaCart
Routing protocols for wireless ad hoc networks have traditionally focused on finding paths with minimum hop count. However, such paths can include slow or lossy links, leading to poor throughput. A routing algorithm can select better paths by explicitly taking the quality of the wireless links
Next 10 →
Results 1 - 10 of 3,802
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University