@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 {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}
}
@conference {12554,
	title = {Factorized variational approximations for acoustic multi source localization},
	booktitle = {Acoustics, Speech and Signal Processing, 2008. ICASSP 2008. IEEE International Conference on},
	year = {2008},
	month = {2008/04/31/4},
	pages = {2409 - 2412},
	abstract = {Estimation based on received signal strength (RSS) is crucial in sensor networks for sensor localization, target tracking, etc. In this paper, we present a Gaussian approximation of the Chi distribution that is applicable to general RSS source localization problems in sensor networks. Using our Gaussian approximation, we provide a factorized variational Bayes (VB) approximation to the location and power posterior of multiple sources using a sensor network. When the source signal and the sensor noise have uncorrelated Gaussian distributions, we demonstrate that the envelope of the sensor output can be accurately modeled with a multiplicative Gaussian noise model. In turn, our factorized VB approximations decrease the computational complexity and provide computational robustness as the number of targets increases. Simulations are provided to demonstrate the effectiveness of the proposed approximations.},
	keywords = {approximation;acoustic, approximation;Bayes, approximation;multisensor, approximation;variational, Bayes, Chi, detection;wireless, distribution;Gaussian, localization;factorized, localization;sensor, methods;Gaussian, multisource, networks;, networks;stochastic, processes;acoustic, sensor, signal, strength;sensor, systems;object, tracking;received, variational},
	doi = {10.1109/ICASSP.2008.4518133},
	author = {Cevher, V. and Sankaranarayanan,A. C and Chellapa, Rama}
}
@conference {12279,
	title = {Differentiated traffic engineering for QoS provisioning},
	booktitle = {INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE},
	volume = {4},
	year = {2005},
	month = {2005/03//},
	pages = {2349 - 2359 vol. 4 - 2349 - 2359 vol. 4},
	abstract = {We introduce a new approach for QoS provisioning in packet networks based on the notion of differentiated traffic engineering (DTE). We consider a single AS network capable of source based multi-path routing. We do not require sophisticated queuing or per-class scheduling at individual routers; instead, if a link is used to forward QoS sensitive packets, we maintain its utilization below a threshold. As a consequence, DTE eliminates the need for per-flow (IntServ) or per-class (DiffServ) packet processing tasks such as traffic classification, queueing, shaping, policing and scheduling in the core and hence poses a lower burden on the network management unit. Conversely, DTE utilizes network bandwidth much more efficiently than simple over-provisioning. In this paper, we propose a complete architecture and an algorithmic structure for DTE. We show that our scheme can be formulated as a non-convex optimization problem, and we present an optimal solution framework based on simulated annealing. We present a simulation-based performance evaluation of DTE, and compare our scheme to existing (gradient projection) methods.},
	keywords = {based, Computer, differentiated, DiffServ, DTE;, engineering;, evaluation;, link;, links;, management;, multipath, network, networks;, nonconvex, of, optimisation;, OPTIMIZATION, packet, performance, problem;, provisioning;, QoS, QUALITY, routing;, service;, simulation-based, source, Telecommunication, traffic, traffic;},
	doi = {10.1109/INFCOM.2005.1498521},
	author = {Tabatabaee,V. and Bhattacharjee, Bobby and La,R.J. and Shayman,M.A.}
}
@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 {18200,
	title = {Distortion management of real-time MPEG-4 video over downlink multicode CDMA networks},
	booktitle = {Communications, 2004 IEEE International Conference on},
	volume = {5},
	year = {2004},
	month = {2004/06//},
	pages = {3071 - 3075 Vol.5 - 3071 - 3075 Vol.5},
	abstract = {In this paper, a protocol is designed to manage source rate/channel coding rate adaptation, code allocation, and power control to transmit real-time MPEG-4 FGS video over downlink multicode CDMA networks. We develop a fast adaptive scheme of distortion management to reduce the overall distortion received by all users subject, to the limited number of codes and maximal transmitted power. Compared with a modified greedy method in literature, our proposed algorithm can reduce the overall system{\textquoteright}s distortion by at least 45\%.},
	keywords = {access;, adaptation;, allocation;, CDMA, channel, code, coding, coding;, combined, communication;, compression;, control;, data, distortion, division, downlink, links;, management;, MPEG-4, multicode, multiple, networks;, power, radio, rate, real-time, resource, source, source-channel, video, video;, visual},
	doi = {10.1109/ICC.2004.1313096},
	author = {Su,Guan-Ming and Han,Zhu and Kwasinski,A. and M. Wu and Liu,K. J.R and Farvardin,N.}
}
@conference {18207,
	title = {Efficient bandwidth resource allocation for low-delay multiuser MPEG-4 video transmission},
	booktitle = {Communications, 2004 IEEE International Conference on},
	volume = {3},
	year = {2004},
	month = {2004/06//},
	pages = {1308 - 1312 Vol.3 - 1308 - 1312 Vol.3},
	abstract = {An efficient bandwidth resource allocation algorithm with low delay and low fluctuation of quality to transmit multiple MPEG-4 fine granularity scalability (FGS) video programs to multiple users is proposed in this paper. By exploring the variation in the scene complexity of each video program and jointly redistributing available system resources among users, our proposed algorithm provides low fluctuation of quality for each user and consistent quality among all users. Experimental results show that compared to a traditional look-ahead sliding-window approach, our scheme can achieve comparable perceptual quality and channel utilization at a much lower cost of delay, computation, and storage.},
	keywords = {algorithm;, allocation, allocation;, approach;, Bandwidth, broadband, channel, channels;, coding;, delays;, expert, FGS;, fine, granularity, group;, look-ahead, moving, MPEG-4, multiuser, networks;, of, picture, program;, QUALITY, resource, scalability;, service;, sliding-window, transmission;, utilization;, video},
	doi = {10.1109/ICC.2004.1312724},
	author = {Su,Guan-Ming and M. Wu}
}
@conference {12304,
	title = {Cooperative peer groups in NICE},
	booktitle = {INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications. IEEE Societies},
	volume = {2},
	year = {2003},
	month = {2003///},
	pages = {1272 - 1282 vol.2 - 1272 - 1282 vol.2},
	abstract = {A distributed scheme for trust inference in peer-to-peer networks is presented. Our work is in context of the NICE system, which is a platform for implementing cooperative applications over the Internet. We describe a technique for efficiently storing user reputation information in a completely decentralized manner, and show how this information can be used to efficiently identify noncooperative users in NICE. We present a simulation based study of our algorithms, in which we show our scheme scales to thousands of users using modest amounts of storage, processing, and bandwidth at any individual node. Lastly, we show that our scheme is robust and can form cooperative groups in systems where the vast majority of users are malicious.},
	keywords = {algorithm;, cooperative, decentralized, distributed, identification;, individual, inference, inference;, information, Internet;, malicious, manner;, mechanisms;, networks;, NICE, node;, noncooperative, peer-to-peer, platform;, reputation, retrieval;, storage;, system;, trust, users, users;},
	doi = {10.1109/INFCOM.2003.1208963},
	author = {Lee,S. and Sherwood,R. and Bhattacharjee, Bobby}
}
@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.}
}
@conference {12299,
	title = {On the use of flow migration for handling short-term overloads},
	booktitle = {Global Telecommunications Conference, 2003. GLOBECOM {\textquoteright}03. IEEE},
	volume = {6},
	year = {2003},
	month = {2003/12//},
	pages = {3108 - 3112 vol.6 - 3108 - 3112 vol.6},
	abstract = {In this work, we investigate flow migration as a mechanism to sustain QoS to network users during short-term overloads in the context of an MPLS IP network. We experiment with three different control techniques: static long-term optimal mapping of flows to LSPs; on-line locally optimal mapping of flows to LSPs at flow set-up time; and dynamic flow migration in response to transient congestion. These techniques are applicable over different timescales, have different run-time overheads, and require different levels of monitoring and control software inside the network. We present results both from detailed simulations and a complete implementation using software IP routers. We use voice-over-IP as our test application, and show that if end-to-end quality is to be maintained during short unpredictable bursts of high load, then a fast-timescale control such as migration is required.},
	keywords = {computing;, CONGESTION, congestion;, CONTROL, control;, dynamic, end-to-end, engineering, fast-timescale, flow, Internet, IP, label, long-term, mapping;, migration;, MPLS, multiprotocol, network, network;, networks;, of, optimal, overloads;, protocol;, QoS;, QUALITY, quality;, routers;, routing;, service;, set-up, short-term, software, software;, static, switching;, Telecommunication, telephony;, time;, transient, voice-over-IP;},
	doi = {10.1109/GLOCOM.2003.1258807},
	author = {Kuo,Kuo-Tung and Phuvoravan,S. and Bhattacharjee, Bobby and Jun La,R. and Shayman,M. and Chang,Hyeong Soo}
}
