@conference {18218,
	title = {Gradient descent approach for secure localization in resource constrained wireless sensor networks},
	booktitle = {Acoustics Speech and Signal Processing (ICASSP), 2010 IEEE International Conference on},
	year = {2010},
	month = {2010/03//},
	pages = {1854 - 1857},
	abstract = {Many sensor network related applications require precise knowledge of the location of constituent nodes. In these applications, it is desirable for the wireless nodes to be able to autonomously determine their locations before they start sensing and transmitting data. Most localization algorithms rely on anchor nodes whose locations are known to determine the positions of the remaining nodes. In an adversarial scenario, some of these anchor nodes could be compromised and used to transmit misleading information aimed at preventing the accurate localization of the remaining sensors. In this paper, a computationally efficient algorithm to determine the location of sensors that can resist such attacks is described. The proposed algorithm combines gradient descent with a selective pruning of inconsistent measurements to achieve good localization accuracy. Simulation results show that the proposed algorithm has performance comparable to existing schemes while requiring less computational resources.},
	keywords = {algorithms;resource, approach;localization, computational, constrained, descent, localization;gradient, methods;wireless, networks;, networks;secure, resources;gradient, sensor, wireless},
	doi = {10.1109/ICASSP.2010.5495371},
	author = {Garg,R. and Varna,A.L. and M. Wu}
}
@conference {12227,
	title = {Channel Access Throttling for Improving WLAN QoS},
	booktitle = {Sensor, Mesh and Ad Hoc Communications and Networks, 2009. SECON {\textquoteright}09. 6th Annual IEEE Communications Society Conference on},
	year = {2009},
	month = {2009/06//},
	pages = {1 - 9},
	abstract = {The de facto QoS channel access method for the IEEE 802.11 Wireless LANs is the Enhanced Distributed Channel Access (EDCA) mechanism, which differentiates transmission treatments for data frames belonging to different traffic categories with four different levels of channel access priority. In this paper, we propose extending EDCA with Channel Access Throttling (CAT) for more flexible and efficient QoS support. By assigning different member stations different channel access parameters, CAT differentiates channel access priorities not between traffic categories but between member stations. Then by dynamically changing the channel access parameters of each member station based on a pre-computed schedule, CAT enables EDCA WLANs the benefits of scheduled access QoS. We also present evaluation results of CAT obtained from both simulations and experiments conducted using off-the-shelf WLAN hardware and open-source device driver. Our results show that CAT can proportionally partition channel capacity, significantly improve performance of multimedia applications, effectively achieve performance protection for admitted flows, and increase per cell VoIP call capacity by up to 41\%.},
	keywords = {802.11, access, area, call, capacity;data, capacity;quality, capacity;WLAN, categories;transmission, channel, device, distributed, driver;quality, facto, frames;de, IEEE, LAN;, LAN;VoIP, local, mechanism;member, method;enhanced, multimedia, network;wireless, networks;channel, of, parameters;channel, priority;channel, QoS, QoS;channel, service;telecommunication, service;traffic, standards;telecommunication, stations;open-source, throttling;channel, traffic;wireless, treatments;wireless, wireless},
	doi = {10.1109/SAHCN.2009.5168915},
	author = {Han,Bo and Ji,Lusheng and Lee,Seungjoon and Miller,R.R. and Bhattacharjee, Bobby}
}
@conference {12555,
	title = {Compressive wireless arrays for bearing estimation},
	booktitle = {Acoustics, Speech and Signal Processing, 2008. ICASSP 2008. IEEE International Conference on},
	year = {2008},
	month = {2008/04/31/4},
	pages = {2497 - 2500},
	abstract = {Joint processing of sensor array outputs improves the performance of parameter estimation and hypothesis testing problems beyond the sum of the individual sensor processing results. When the sensors have high data sampling rates, arrays are tethered, creating a disadvantage for their deployment and also limiting their aperture size. In this paper, we develop the signal processing algorithms for randomly deployable wireless sensor arrays that are severely constrained in communication bandwidth. We focus on the acoustic bearing estimation problem and show that when the target bearings are modeled as a sparse vector in the angle space, low dimensional random projections of the microphone signals can be used to determine multiple source bearings by solving an <i>l</i> <sub>1</sub>-norm minimization problem. Field data results are shown where only 10 bits of information is passed from each microphone to estimate multiple target bearings.},
	keywords = {acoustic, algorithms;sparse, arrays;acoustic, arrays;hypothesis, bandwidth;compressive, bearing, Estimation, estimation;signal, estimation;sparse, matrices;vectors;wireless, minimization, networks;, problem;communication, problem;microphone, problems;joint, PROCESSING, processing;array, processing;direction-of-arrival, processing;l<sub>1</sub>-norm, sensor, signal, signals;parameter, Testing, vector;wireless, wireless},
	doi = {10.1109/ICASSP.2008.4518155},
	author = {Cevher, V. and Gurbuz, A.C. and McClellan, J.H. and Chellapa, Rama}
}
@article {12239,
	title = {Efficient and Resilient Backbones for Multihop Wireless Networks},
	journal = {Mobile Computing, IEEE Transactions on},
	volume = {7},
	year = {2008},
	month = {2008/11//},
	pages = {1349 - 1362},
	abstract = {We consider the problem of finding "backbones" in multihop wireless networks. The backbone provides end-to-end connectivity, allowing nonbackbone nodes to save energy since they do not have to route nonlocal data or participate in the routing protocol. Ideally, such a backbone would be small, consist primarily of high capacity nodes, and remain connected even when nodes are mobile or fail. Unfortunately, it is often infeasible to construct a backbone that has all of these properties; e.g., a small optimal backbone is often too sparse to handle node failures or high mobility. We present a parameterized backbone construction algorithm that permits explicit trade-offs between backbone size, resilience to node movement and failure, energy consumption, and path lengths. We prove that our scheme can construct essentially best possible backbones (with respect to energy consumption and backbone size) when the network is relatively static. We generalize our scheme to build more robust structures better suited to networks with higher mobility. We present a distributed protocol based upon our algorithm and show that this protocol builds and maintains a connected backbone in dynamic networks. Finally, we present detailed packet-level simulation results to evaluate and compare our scheme with existing energy-saving techniques. Our results show that, depending on the network environment, our scheme increases network lifetimes by 20 percent to 220 percent without adversely affecting delivery ratio or end-to-end latency.},
	keywords = {algorithm;protocols;wireless, backbone, channels;, CONSTRUCTION, distributed, networks;parameterized, protocol;multihop, wireless},
	isbn = {1536-1233},
	doi = {10.1109/TMC.2008.69},
	author = {Lee,Seungjoon and Bhattacharjee, Bobby and Srinivasan, Aravind and Khuller, Samir}
}
@article {18007,
	title = {A bootstrapping model for directional wireless networks},
	journal = {Communications Letters, IEEE},
	volume = {10},
	year = {2006},
	month = {2006/12//},
	pages = {840 - 842},
	abstract = {Initially configuring or bootstrapping a connected topology in directional wireless networks is a challenging problem, especially when nodes only have local connectivity information and a limited number of transceivers. This paper presents a scalable bootstrapping model which integrates: 1) a distributed bottom-up algorithm that constructs a spanning tree with degree at most one larger than the optimal 2) a resource discovery algorithm for efficient dissemination of local connectivity information, and 3) synchronization protocols to guarantee the efficient emergence of overall network connectivity from local interactions. We investigate the feasibility and scalability of the proposed model. Results are presented for different network systems, with varying size and signaling data rates.},
	keywords = {(mathematics);, algorithm;resource, algorithm;spanning, bootstrapping, bottom-up, discovery, model;directional, network;distributed, networks;trees, protocols;protocols;radio, tree;synchronization, wireless},
	isbn = {1089-7798},
	doi = {10.1109/LCOMM.2006.060808},
	author = {Milner,S. and Llorca,J. and Anibha,A. and Vishkin, Uzi}
}
@conference {18237,
	title = {Joint uplink and downlink optimization for video conferencing over wireless LAN},
	booktitle = {Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP {\textquoteright}05). IEEE International Conference on},
	volume = {2},
	year = {2005},
	month = {2005/03//},
	pages = {ii/1101 - ii/1104 Vol. 2 - ii/1101 - ii/1104 Vol. 2},
	abstract = {A real-time video conferencing framework is proposed for multiple conferencing pairs by jointly considering the uplink and downlink conditions within IEEE 802.11 networks. We formulate this system so as to minimize the maximal end-to-end expected distortion received by all users by selecting the PHY modes and transmission time. Compared with the strategy of individually optimizing uplink and downlink, the proposed framework outperforms by 3.67-8.65 dB for the average received PSNR among all users.},
	keywords = {802.11, conferencing, conferencing;, distortion;, end-to-end, expected, IEEE, joint, LAN;, maximal, minimisation;, modes;, multiple, networks;, optimization;, pairs;, PHY, PSNR;, real-time, teleconferencing;, time;, transmission, uplink-downlink, video, wireless},
	doi = {10.1109/ICASSP.2005.1415601},
	author = {Su,Guan-Ming and Han,Zhu and M. Wu and Liu,K. J.R}
}
@conference {12290,
	title = {The case for a multi-hop wireless local area network},
	booktitle = {INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies},
	volume = {2},
	year = {2004},
	month = {2004/03//},
	pages = {894 - 905 vol.2 - 894 - 905 vol.2},
	abstract = {We propose a multi-hop wireless LAN architecture and demonstrate its benefits to wireless clients. For this architecture, we define implementation paths that allow interoperation with existing wireless LANs which can lead to an incremental deployment of this system. We quantify the performance benefits of the proposed schemes through measurements in realistic wireless LAN environments. We also examine the performance of such multi-hop wireless LANs through detailed simulation studies. Our results show that these multi-hop extensions can significantly improve the wireless access experience (in terms of data throughput, latency, etc.) for clients who enable such mechanisms. More interestingly, when multi-hop extensions are enabled by some of the clients, it also positively impacts the performance at other clients that are completely unaware of these extensions.},
	keywords = {access, access;, area, benefits;, client-server, clients;, interoperation;, LAN;, local, multihop, network;, networks;, performance, radio, systems;, wireless},
	doi = {10.1109/INFCOM.2004.1356977},
	author = {Lee,Seungjoon and Banerjee,S. and Bhattacharjee, Bobby}
}
@conference {18201,
	title = {Dynamic distortion control for 3-D embedded wavelet video over multiuser OFDM networks},
	booktitle = {Global Telecommunications Conference, 2004. GLOBECOM {\textquoteright}04. IEEE},
	volume = {2},
	year = {2004},
	month = {2004/12/03/nov},
	pages = {650 - 654 Vol.2 - 650 - 654 Vol.2},
	abstract = {In this paper, we propose a system to transmit multiple 3D embedded wavelet video programs over downlink multiuser OFDM. We consider the fairness among users and formulate the problem as minimizing the users{\textquoteright} maximal distortion subject to power, rate, and subcarrier constraints. By exploring frequency, time, and multiuser diversity in OFDM and flexibility of the 3D embedded wavelet video codec, the proposed algorithm can achieve fair video qualities among all users. Compared to a scheme similar to the current multiuser OFDM standard (IEEE 802.11a), the proposed scheme outperforms it by 1-5 dB on the worst received PSNR among all users and has much smaller PSNR deviation.},
	keywords = {3D, 802.11a;, channels;, codec;, codecs;, communication;, control;, deviation;, distortion, diversity, diversity;, downlink, dynamic, embedded, fairness;, Frequency, IEEE, LAN;, maximal, minimax, minimization;, modulation;, multimedia, multiuser, OFDM, OFDM;, PSNR, rate, reception;, streaming;, systems;, techniques;, theory;, TIME, transforms;, video, video;, wavelet, wireless},
	doi = {10.1109/GLOCOM.2004.1378042},
	author = {Su,Guan-Ming and Han,Zhu and M. Wu and Liu,K. J.R}
}
@conference {11911,
	title = {Energy-efficient broadcast and multicast trees for reliable wireless communication},
	booktitle = {Wireless Communications and Networking, 2003. WCNC 2003. 2003 IEEE},
	volume = {1},
	year = {2003},
	month = {2003/03//},
	pages = {660 -667 vol.1 - 660 -667 vol.1},
	abstract = {We define energy-efficient broadband and multicast schemes for reliable communication in multi-hop wireless networks. Unlike previous techniques, the choice of neighbors in the broadband and multicast trees in these schemes, are based not only on the link distance, but also on the error rates associated with the link. Our schemes can be implemented using both positive and negative acknowledgement based reliable broadcast techniques in the link layer. Through simulations, we show that our scheme achieves up to 45\% improvement over previous schemes on realistic 100-node network topologies. A positive acknowledgment based implementation is preferred. Our simulations show that the additional benefits of a positive acknowledgement based implementation is marginal (1-2\%). Therefore a negative acknowledgement based implementation of our schemes is equally applicable in constructing energy-efficient reliable and multicast data delivery paths.},
	keywords = {broadcast, channels;multicast, communication;broadcast, communication;network, data, delivery, energy-efficient, layer;multicast, network, networks;network, networks;telecommunication, paths;multicast, rates;link, reliability;, topologies;wireless, topology;radio, trees;error, trees;multihop, wireless},
	doi = {10.1109/WCNC.2003.1200429},
	author = {Banerjee,S. and Misra,A. and Yeo,Jihwang and Agrawala, Ashok K.}
}
@conference {15096,
	title = {Toward secure key distribution in truly ad-hoc networks},
	booktitle = {Applications and the Internet Workshops, 2003. Proceedings. 2003 Symposium on},
	year = {2003},
	month = {2003/01//},
	pages = {342 - 346},
	abstract = {Ad-hoc networks - and in particular wireless mobile ad-hoc networks $have unique characteristics and constraints that make traditional cryptographic mechanisms and assumptions inappropriate. In particular it may not be warranted to assume pre-existing shared secrets between members of the network or the presence of a common PKI. Thus, the issue of key distribution in ad-hoc networks represents an important problem. Unfortunately, this issue has been largely ignored; as an example, most protocols for secure ad-hoc routing assume that key distribution has already taken place. Traditional key distribution schemes either do not apply in an ad-hoc scenario or are not efficient enough for small, resource-constrained devices. We propose to combine efficient techniques from identity-based (ID-based) and threshold cryptography to provide a mechanism that enables flexible and efficient key distribution while respecting the constraints of ad-hoc networks. We also discuss the available mechanisms and their suitability for the proposed task.},
	keywords = {ad, ad-hoc, cryptography;, distribution;, hoc, identity-based, key, mobile, network, networks;, routing;, secure, security;, Telecommunication, threshold, wireless},
	doi = {10.1109/SAINTW.2003.1210183},
	author = {Khalili,A. and Katz, Jonathan and Arbaugh, William A.}
}
@article {11913,
	title = {Rover: scalable location-aware computing},
	journal = {Computer},
	volume = {35},
	year = {2002},
	month = {2002/10//},
	pages = {46 - 53},
	abstract = {All the components necessary for realizing location-aware computing are available in the marketplace today. What has hindered the widespread deployment of location-based systems is the lack of an integration architecture that scales with user populations. The authors have completed the initial implementation of Rover, a system designed to achieve this sort of integration and to automatically tailor information and services to a mobile user{\textquoteright}s location. Their studies have validated Rover{\textquoteright}s underlying software architecture, which achieves system scalability through high-resolution, application-specific resource scheduling at the servers and network. The authors believe that this technology will greatly enhance the user experience in many places, including museums, amusement and theme parks, shopping malls, game fields, offices, and business centers. They designed the system specifically to scale to large user populations and expect its benefits to increase with them.},
	keywords = {amusement, application-specific, architecture;, automation;, business, business;, computing;, data, entertainment;, handheld, humanities;, integration, LAN;, location-aware, malls;, mobile, museums;, office, parks;, processing;, resource, Rover;, scalability;, scalable, scheduling;, shopping, software, system, theme, units;, user;, wireless},
	isbn = {0018-9162},
	doi = {10.1109/MC.2002.1039517},
	author = {Banerjee,S. and Agarwal,S. and Kamel,K. and Kochut, A. and Kommareddy,C. and Nadeem,T. and Thakkar,P. and Trinh,Bao and Youssef,A. and Youssef, M. and Larsen,R.L. and Udaya Shankar,A. and Agrawala, Ashok K.}
}
