Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Physical Sciences and Mathematics
Analysis Of A Campus-Wide Wireless Network, David Kotz, Kobby Essien
Analysis Of A Campus-Wide Wireless Network, David Kotz, Kobby Essien
Dartmouth Scholarship
Understanding usage patterns in wireless local-area networks (WLANs) is critical for those who develop, deploy, and manage WLAN technology, as well as those who develop systems and application software for wireless networks. This paper presents results from the largest and most comprehensive trace of network activity in a large, production wireless LAN. For eleven weeks we traced the activity of nearly two thousand users drawn from a general campus population, using a campus-wide network of 476 access points spread over 161 buildings. Our study expands on those done by Tang and Baker, with a significantly larger and broader population. \par …
A Label-Switching Packet Forwarding Architecture For Multi-Hop Wireless Lans, Arup Acharya, Archan Misra, Sorav Bansal
A Label-Switching Packet Forwarding Architecture For Multi-Hop Wireless Lans, Arup Acharya, Archan Misra, Sorav Bansal
Research Collection School Of Computing and Information Systems
A router in wired network typically requires multiple network interfaces to act as a router or a forwarding node. In an ad-hoc multi-hop wireless network on the other hand, any node with a wireless network interface card can operate as a router or a forwarding node, since it can receive a packet from a neighboring node, do a route lookup based on the packet's destination IP address, and then transmit the packet to another neighboring node using the same wireless interface. This paper investigates a combined medium access and next-hop address lookup based on fixed length labels (instead of IP …
Three Power-Aware Routing Algorithms For Sensor Networks, Javed Aslam, Qun Li, Daniela Rus
Three Power-Aware Routing Algorithms For Sensor Networks, Javed Aslam, Qun Li, Daniela Rus
Dartmouth Scholarship
This paper discusses online power‐aware routing in large wireless ad hoc networks (especially sensor networks) for applications in which the message sequence is not known. We seek to optimize the lifetime of the network. We show that online power‐aware routing does not have a constant competitive ratio to the off‐line optimal algorithm. We develop an approximation algorithm called max–min zPmin that has a good empirical competitive ratio. To ensure scalability, we introduce a second online algorithm for power‐aware routing. This hierarchical algorithm is called zone‐based routing. Our experiments show that its performance is quite good. Finally, we …