· Web view@STRING{ACMTPLS= "ACM Transactions on Programming Languages and Systems" } @STRING{ACTA= "Acta Informatica" } @STRING{ADM= "Annals of Discrete Mathematics" } @STRING

@STRING{ACMTPLS = "ACM Transactions on Programming Languages and Systems" }@STRING{ACTA = "Acta Informatica" }@STRING{ADM = "Annals of Discrete Mathematics" }@STRING{ALG = "Algorithmica" }@STRING{AW = "Addison--Wesley" }@STRING{CACM = "Communication of the ACM" }@STRING{CC = "Computational Complexity" }@STRING{CM = "IEEE Communications Magazine" }@STRING{CN = "Computer Networks" }@STRING{CNISDN = "Computer Networks and ISDN Systems" }@STRING{COMB = "Combinatorica" }@STRING{DAM = "Discrete Applied Mathematics" }@STRING{DC = "Distributed Computing" }@STRING{DM = "Discrete Mathematics" }@STRING{EATCS = "Bulletin of EATCS" }@STRING{FOCS = "Ann. IEEE Symp. on Foundations of Computer Science" }@STRING{GC = "Graphs and Combinatorics" }@STRING{HAN = "Handbook of Theoretical Computer Science" }@STRING{IC = "Information and Computation" }@STRING{ICALP = "International Colloquium on Automata, Languages, and

Programming" }@STRING{ICSI = "International Computer Science Institute" }@STRING{ICTRL = "Information and Control" }@STRING{IEEETC = "IEEE Transactions on Communications" }@STRING{IEEETIT = "IEEE Transactions on Information Theory" }@STRING{IPL = "Information Processing Letters" }@STRING{JA = "Journal of Algorithms" }@STRING{JACM = "Journal of the ACM" }@STRING{JCSS = "Journal of Computer and System Sciences" }@STRING{JSAC = "Journal on Selected Areas in Communications" }@STRING{LNCS = "Lecture Notes in Computer Science" }@STRING{OSR = "Operating Systems Review" }@STRING{PCS = "IEEE Personal Communication" }@STRING{PODC = "Ann. ACM Symp. on Principles of Distributed Computing" }@STRING{RAIRO = "RAIRO Informatique Th{\'e}orique et Applications" }@STRING{SIAMJC = "SIAM Journal on Computing" }@STRING{SODA = "ACM-SIAM Symp. on Discrete Algorithms" }@STRING{SPAA = "ACM Symp. on Parallel Algorithms and Architectures" }@STRING{STACS = "Annual Symposium on Theoretical Aspects of Computer

Science" }@STRING{STOC = "Annual ACM Symposium on Theory of Computing" }@STRING{STRUCT = "IEEE Structure in Complexity Theory Conference" }@STRING{SV = "Sprin\-ger-Ver\-lag" }@STRING{TCS = "Theoretical Computer Science" }@STRING{WN = "Wireless Networks" }

@Booklet{802.11, TITLE = {{IEEE} Standard for Information Technology.

{T}elecommunications and information exchange between systems-Local and metropolitan area networks-Part 11: Wireless {LAN} Medium Access Control ({MAC}) and Physical Layer ({PHY}) specifications},

YEAR = {1999}}

@Booklet{802.15.1, TITLE = {{IEEE} Standard for Information Technology. {P}art 15.1:

Wireless Medium Access Control ({MAC}) and Physical Layer ({PHY}). {S}pecifications for Wireless Personal Area Networks ({WPANS})},

YEAR = {2002}}


Wireless Medium Access Control ({MAC}) and Physical Layer ({PHY}). {S}pecifications for High Rate Wireless Personal Area Networks ({LR-WPANs})},

YEAR = {2003}}


Wireless Medium Access Control ({MAC}) and Physical Layer ({PHY}). {S}pecifications for Low-Rate Wireless Personal Area Networks ({LR-WPANs})},

YEAR = {2003}}

@Article{AbutalebL97a, AUTHOR = {Abutaleb, A. and Li, V. O. K.}, TITLE = {Location Update Optimization in Personal Communication

Systems}, JOURNAL = {Wireless Networks}, VOLUME = 3, NUMBER = 3, PAGES = {205--216}, MONTH = {August}, YEAR = 1997}

@Article{AbutalebL97b, AUTHOR = {Abutaleb, A. and Li, V. O. K.}, TITLE = {Paging Strategy Optimization in Personal Communication

Systems}, JOURNAL = {Wireless Networks}, VOLUME = 3, NUMBER = 3, PAGES = {195--204}, MONTH = {August}, YEAR = 1997}

@InProceedings{AcharyaB92, AUTHOR = {Acharya, A. and Badrinath, B. R.}, TITLE = {Recording Distributed Snapshots Based on Causal Order of

Message Delivery}, BOOKTITLE = IPL, YEAR = 1992, PAGES = {317--321}}

@InProceedings{AcharyaB93, AUTHOR = {Acharya, A. and Badrinath, B. R.}, TITLE = {Delivering Multicast Messages in Networks with Mobile

Hosts}, BOOKTITLE = {Proceedings of The 13th International Conference on

Distributed Computing Systems}, YEAR = 1993, PAGES = {292--299}}

@Article{AcharyaBI93, AUTHOR = {Acharya, A. and Badrinath, B. R. and Imielinski, T.}, TITLE = {Impact of Mobility on Distributed Computations}, JOURNAL = OSR, VOLUME = 27, NUMBER = 2, PAGES = {15--20}, MONTH = {April}, YEAR = 1993, ABSTRACT = {The integration of mobile/portable computers within

existing static networks introduces a new set of issues to distributed computations. A mobile host can connect to the network from different locations at different times; distributed algorithms therefore, cannot rely on the assumption that participant maintains a fixed and

universally known location in the network at all times. Mobile hosts communicate with the rest of the network via a wireless broadcast medium and portable computers such as laptops and palmtops, often operate in a 'disconnected' or doze mode to conserve battery power. These unique physical features of a mobile computing environment need to be considered as well, while designing distributed algorithms for such systems (17 Refs.)}

}

@InProceedings{AcharyaBI94, AUTHOR = {Acharya, A. and Badrinath, B. R. and Imielinski, T.}, TITLE = {Structuring Distributed Algorithms for Mobile Hosts}, BOOKTITLE = {Proceedings of The 14th International Conference on

Distributed Computing Systems}, YEAR = 1994, PAGES = {21--28}}

@Article{AdjihJV05, AUTHOR = {Adjih, C. and Jacquet, P. and Viennot, L.}, TITLE = {Computing Connected Dominated Sets with Multipoint

Relays}, JOURNAL = {Ad Hoc \& Sensor Wireless Networks}, YEAR = {2005}, VOLUME = {1}, NUMBER = {1}, PAGES = {27--39}}

@InProceedings{AdyaBPWZ04, AUTHOR = {Adya, A. and Bahl, P. and Padhye, J. and Wolman, A. and

Zhou, L.}, TITLE = {A Multi-radio Unification Protocol for IEEE 802.11

Wireless Networks}, BOOKTITLE = {Proceedings of the First International Conference on

Broadband Networks, BroadNets 2004}, PAGES = {344--354}, YEAR = {2004}, ADDRESS = {San Jose, CA}, MONTH = {October 25--29}}

@Book{AgrawalZ06, AUTHOR = {Agrawal, D. P. and Zeng, Q.-A.}, TITLE = {Introduction to Wireless and Mobile Systems},

PUBLISHER= {Thompson/Nelson}, YEAR = {2006}, ADDRESS = {Toronto, ON, Canada}, EDITION = {Second}}

@InProceedings{AjmoneMarsanCNCD02, AUTHOR = {Ajmone~Marsan, M. and Chiasserini, C. F. and Nucci, A. and Carello, G. and De~Giovanni, L.}, TITLE = {Optimizing the Topology of {B}luetooth Wireless Personal Area Networks}, BOOKTITLE = {Proceedings of IEEE Infocom 2002}, YEAR = {2002}, ADDRESS = {New York}, MONTH = {23--27 June}}

@InProceedings{AkkayaY03, AUTHOR = {Akkaya, K. and Younis, M.}, TITLE = {An Energy-Aware QoS Routing Protocol for Wireless Sensor

Networks}, BOOKTITLE = {Proceedings of the $23$rd International Conference on

Distributed Computing Systems Workshop, (ICDCSW 2003)}, PAGES = {710--715}, YEAR = {2003}, ADDRESS = {Providence, RI}, MONTH = {May 19--22}}

@InProceedings{AkkayaY04, AUTHOR = {Akkaya, K. and Younis, M.}, TITLE = {Energy-aware to Mobile Gateway in Wireless Sensor

Networks}, BOOKTITLE = {Proceedings of the IEEE Globecom 2004 Workshops}, PAGES = {16--21}, YEAR = {2004}, ADDRESS = {Dallas, TX}, MONTH = {November 29--December 3}}

@Article{AkkayaY05, AUTHOR = {Akkaya, K. and Younis, M.}, TITLE = {A Survey on Routing Protocols for Wireless Sensor

Networks}, JOURNAL = {Elsevier Ad Hoc Networks}, YEAR = {2005},

VOLUME = {3}, NUMBER = {3}, PAGES = {325--349}, MONTH = {May}}

@Article{AkyildizMC07, AUTHOR = {Akyildiz, I. F. and Melodia, T. and Chowdhury, K. R.}, TITLE = {A Survey on Wireless Multimedia Sensor Networks}, JOURNAL = {Elsevier's Computer Networks Journal}, YEAR = {2007}, VOLUME = {51}, NUMBER = {4}, PAGES = {921--960}, MONTH = {March 14}}

@Article{AkyildizPM04, AUTHOR = {Akyildiz, I. F. and Pompili, D. and Melodia, T.}, TITLE = {Challenges for Efficient Communication in Underwater

Acoustic Sensor Networks}, JOURNAL = {ACM SIGBED Review, Special Issue on Embedded Sensor

Networks and Wireless Computing, T.~Abdelzaher, ed.}, VOLUME = {1}, NUMBER = {2}, YEAR = {2004}, PAGES = {3--8}, PUBLISHER= {ACM Press}, ADDRESS = {New York, NY}}

@Article{AkyildizPM05, AUTHOR = {Akyildiz, I. F. and Pompili, D. and Melodia, T.}, TITLE = {Underwater Acoustic Sensor Networks: Research Challenges}, JOURNAL = {Elsevier's Journal of Ad Hoc Networks}, YEAR = {2005}, VOLUME = {3}, NUMBER = {3}, PAGES = {257--279}, MONTH = {May}}

@Article{AkyildizS06, AUTHOR = {Akyildiz, I. F. and Stuntebeck, E. P.}, TITLE = {Wireless Underground Sensor Networks: Research

Challenges},

JOURNAL = {Elsevier's Ad Hoc Networks}, YEAR = {2006}, VOLUME = {4}, NUMBER = {6}, PAGES = {669--686}, MONTH = {November}}

@Article{AkyildizSSC02, AUTHOR = {Akyildiz, I. F. and Su, W. and Sankarasubramaniam, Y. and

Cayirci, E.}, TITLE = {Wireless Sensor Networks: A Survey}, JOURNAL = {Computer Networks}, YEAR = {2002}, VOLUME = {38}, NUMBER = {4}, PAGES = {393--422}, MONTH = {March}}

@Article{AkyildizWW05, AUTHOR = {Akyildiz, I. F. and Wang, X. and Wang, W.}, TITLE = {Wireless Mesh Networks: A Survey}, JOURNAL = {Computer Networks}, YEAR = {2005}, VOLUME = {47}, NUMBER = {4}, PAGES = {445--487}, MONTH = {March 15}}

@Book{AkyildizV10, AUTHOR = {Akyildiz, I. F. and Vuran, M. C.}, TITLE = {Wireless Sensor Networks}, PUBLISHER= {John Wiley \& Sons}, YEAR = {2010}, ADDRESS = {Hoboken, NJ}}

@Article{Al-KarakiK04, AUTHOR = {Al-Karaki, J. N. and Kamal, A. E.}, TITLE = {Routing Techniques in Wireless Sensor Networks: A Survey}, JOURNAL = {IEEE Wireless Communications}, YEAR = {2004}, VOLUME = {11}, NUMBER = {6},

PAGES = {6--28}, MONTH = {December}}

@InProceedings{AlbanoCNP07, AUTHOR = {Albano, M. and Chessa, S. and Nidito, F. and Pelagatti,

S.}, TITLE = {{Q-NiGHT}: {A}dding {QoS} to Data Centric Storage in

Non-uniform Sensor Networks}, PAGES = {166--173}, BOOKTITLE = {Proceedings of the $8$th International Conference on

{M}obile {D}ata {M} anagement, MDM 2007)}, ADDRESS = {Mannheim, Germany}, MONTH = {May 7--11}, YEAR = 2007}

@InProceedings{AlicherryBL05, AUTHOR = {Alicherry, M. and Bhatia, R. and Li, (E.) L.}, TITLE = {Joint Assignment and Routing for Throughput Optimization

in Multi-Radio Wireless Mesh Networks}, BOOKTITLE = {Proceedings of the $11$th ACM Annual International

Conference on Mobile Computing and Networking, MobiCom 2005},

PAGES = {58--72}, YEAR = {2005}, ADDRESS = {Cologne, Germany}, MONTH = {August 28--September 2}}

@Article{AlonBI86, AUTHOR = {Alon, N. and Babai, L. and Itai, A.}, TITLE = {A fast and simple randomized parallel algorithm for the maximal independent set problem}, JOURNAL = JA, VOLUME = 7, NUMBER = 4, PAGES = {567--583}, MONTH = {December}, YEAR = 1986, ABSTRACT = {A simple parallel randomized algorithm to find a maximal

independent set in a graph G=(V, E) on n vertices is presented. Its expected running time on a concurrent-read concurrent-write PRAM with O( mod E mod d/sub max/) processors is O(log n), where d/sub max/ denotes the maximum degree. On an exclusive-read exclusive-write PRAM

with O( mod E mod ) processors the algorithm runs in O(log/sup 2/n). Previously, an O(log/sup 4/n) deterministic algorithm was given by R.M. Karp and A. Wigderson (see Proc. 16th ACM STOC, p.266-72, Washington, DC, 1984) for the EREW-PRAM model. This was recently improved to O(log/sup 2/n) by M. Luby (see Proc. 17th ACM STOC, p.1-10, Providence, RI, 1985). In both cases randomized algorithms depending on pairwise independent choices were turned into deterministic algorithms. The authors comment on how randomized combinatorial algorithms whose analysis only depends on d- wise rather than fully independent random choices (for some constant d) can be converted into deterministic algorithms. They apply a technique due to A. Joffe (see Am. Probability, vol.2, p.161-2, 1974) and obtain deterministic construction in fast parallel time of various combinatorial objects whose existence follows from probabilistic arguments (24 Refs.)}

}

@Article{AlonBLP91, AUTHOR = {Alon, N. and {Bar-Noy}, A. and Linial, N. and Peleg, D.}, TITLE = {A Lower Bound for Radio Broadcast}, JOURNAL = JCSS, VOLUME = 43, NUMBER = 2, PAGES = {290--298}, MONTH = {October}, YEAR = 1991}

@MastersThesis{Alqudah07, AUTHOR = {Alqudah, R.}, TITLE = {On the Effect of Multiple Sinks in Localization for

Wireless Sensor Networks}, SCHOOL = {Northeastern University}, YEAR = {2007}, ADDRESS = {Boston, MA}, MONTH = {July}}

@Article{AlzoubiWF02, AUTHOR = {Alzoubi, K. M. and Wan, P.-J. and Frieder, O.}, TITLE = {Distributed Heuristic for Connected Dominating Sets in

Wireless Ad Hoc Networks}, JOURNAL = {Journal of Communications and Networks}, YEAR = {2002},

VOLUME = {4}, NUMBER = {1}, PAGES = {22--29}, MONTH = {March}}

@Manual{AmigoBot05, TITLE = {AmigoBot}, ORGANIZATION = {Active Media Robotics}, ADDRESS = {Amherst, NH}, YEAR = {2005}, NOTE = {http://www.amigobot.com}}

@InProceedings{AmisP00, AUTHOR = {Amis, A. D. and Prakash, R.}, TITLE = {Load-Balancing Clusters in Wireless Ad Hoc Networks}, BOOKTITLE = {Proceedings of the $3$rd IEEE Symposium on

Application-Specific Systems and Software Engineering Technology, ASSET 2000},

PAGES = {25--32}, YEAR = {2000}, ADDRESS = {Richardson, TX}, MONTH = {March 24--25}}

@InProceedings{AmisPVH00, AUTHOR = {Amis, A. D. and Prakash, R. and Vuong, T. H. P. and Huynh,

D. T.}, TITLE = {Max-Min D-Cluster Formation in Wireless Ad Hoc Networks}, BOOKTITLE = {Proceedings of IEEE Infocom 2000}, PAGES = {32--41}, YEAR = {2000}, VOLUME = {1}, ADDRESS = {Tel Aviv, Israel}, MONTH = {March 26--30}}

@InProceedings{AmourisPL99, AUTHOR = {Amouris, K. N. and Papavassiliou, S. and Li, M.}, TITLE = {A Position-Based Multi-Zone Routing Protocol for Wide Area

Mobile Ad-Hoc Networks}, BOOKTITLE = {Proceedings of the IEEE $49$th Annual International

Vehicular Technology Conference}, VOLUME = 2, PAGES = {1365--1369},

ADDRESS = {Houston, TX}, MONTH = {May 16--20}, YEAR = 1999}

@Book{AndrewsGM07, AUTHOR = {Andrews, J. G. and Ghosh, A. and Muhamed, R.}, TITLE = {Fundamentals of WiMAX: Understanding Broadband Wireless

Networking}, PUBLISHER= {Prentice Hall}, YEAR = 2007, SERIES = {Communication Engineering and Emerging Technologies}, MONTH = {March 9}}

@Article{AnP01, AUTHOR = {An, B. and Papavassilious, S.}, TITLE = {A Mobility-Based Clustering Approach to Support Mobility

Management and Multicast Routing in Mobile Ad Hoc Wireless Networks},

JOURNAL = {International Journal of Network Management}, YEAR = {2001}, VOLUME = {11}, NUMBER = {6}, PAGES = {387--395}, MONTH = {November/December}}

@Article{AroraMLSS98, AUTHOR = {Arora, S. and Lund, C. and Motwani, R. and Sudan, M. and

Szegedy, M.}, TITLE = {Proof Verification and the Hardness of Approximation

Problems}, JOURNAL = {Journal of the ACM}, VOLUME = 45, NUMBER = 3, PAGES = {501--555}, MONTH = {May}, YEAR = 1998, ABSTRACT = {We show that every language in NP has a probabilistic

verifier that checks membership proofs for it using logarithmic number of random bits and by examining a constant number of bits in the proof. If a string is in the language, then there exists a proof such that the verifier accepts with probability 1 (i.e., for every choice of its random string). For strings not in the language. The

verifier rejects every provided ``proof'' with probability at least 1/2. Our result builds upon and improves a recent result of Arora and Safra 1998 whose verifiers examine a nonconstant number of bits in the proof (though this number is a very slowly growing function of the input length). As a consequence, we prove that no MAX SNP-hard problem has a polynomial time approximation scheme, unless NP=P. The class MAX SNP was defined by Papadimitriou and Yannakakis 1991 and hard problems for this class include vertex cover, maximum satisfiability, maximum cut, metric TSP, Steiner trees and shortest superstring. We also improve upon the clique hardness results of Feige et al. 1996 and Arora and Safra 1998 and show that there exists a positive e such that approximating the maximum clique size in an N-vertex graph to within a factor of N/sup epsilon / is NP-hard. (96 References).}

}

@Book{AsmussenH83, AUTHOR = {Asmussen, S. and Hering, H.}, TITLE = {Branching Processes}, PUBLISHER= {Birkh\"auser}, ADDRESS = {Basel, Switzerland}, YEAR = {1983}}

@Book{AusielloCGKMP99, AUTHOR = {Ausiello, G. and Crescenzi, P. and Gambosi, G. and Kann,

V. and {Marchetti-Spaccamela}, A. and Protasi, M.}, TITLE = {Complexity and Approximation. Combinatorial Optimization

Problems and their Approximability Properties}, PUBLISHER= {Springer-Verlag}, YEAR = {1999}, ADDRESS = {Berlin, Germany}, MONTH = {November}}

@InProceedings{AwerbuchHR04, AUTHOR = {Awerbuch, B. and Holmer, D. and Rubens, H.}, TITLE = {High Throughput Route Selection in Multi-rate Ad Hoc

Wireless Networks}, BOOKTITLE = {Proceedings of the First Working Conference on Wireless

On-demand Networks Systems, WONS 2004}, PAGES = {253--270}, YEAR = {2004}, EDITOR = {Battiti, R. and Conti, M. and Lo Cigno, E.},

SERIES = {LNCS 2998}, ADDRESS = {Madonna di Campiglio, TN, Italy}, MONTH = {January 21--23}}

@InProceedings{AwerbuchP90, AUTHOR = {Awerbuch, B. and Peleg, D.}, TITLE = {Sparse Partitions}, BOOKTITLE = {Proceedings of the $31$st Annual Symposium on Foundations

of Computer Science}, VOLUME = 2, PAGES = {503--513}, ADDRESS = {St.\ Louis, MO}, MONTH = {22--24 October}, YEAR = 1990, ABSTRACT = {A collection of clustering and decomposition techniques

that make possible the construction of sparse and locality-preserving representations for arbitrary networks is presented. The representation method considered is based on breaking the network G(V,E) into connected regions, or clusters, thus obtaining a cover for the network, i.e. a collection of clusters that covers the entire set of vertices V. Several other graph-theoretic structures that are strongly related to covers are discussed. These include sparse spanners, tree covers of graphs and the concepts of regional matchings and diameter-based separators. All of these structures can be constructed by means of one of the clustering algorithms given, and each has proved a convenient representation for handling certain network applications. (25 References).}

}

@InProceedings{AwerbuchP90a, AUTHOR = {Awerbuch, B. and Peleg, D.}, TITLE = {Network Synchronization with Polylogarithmic Overhead}, BOOKTITLE = {Proceedings of the $31$st Annual Symposium on Foundations

of Computer Science}, VOLUME = 2, PAGES = {514--522}, ADDRESS = {St.\ Louis, MO}, MONTH = {22--24 October}, YEAR = 1990, ABSTRACT = {The synchronizer is a simulation methodology for

simulating a synchronous network by an asynchronous one, thus enabling the execution of a synchronous algorithm on an asynchronous network. Previously known synchronizers

require each processor in the network to participate in each pulse of the synchronization process. The resulting communication overhead depends linearly on the number n of network nodes. A synchronizer with overhead only polylogarithmically dependent on n is introduced. This synchronizer can also be realized with polylog(n) space. The polylog-overhead synchronizer is based on involving only the relevant portions of the network in the synchronization process. (21 References).}

}

@InProceedings{AzadC06, AUTHOR = {Azad, A. P. and Chockalingam, A.}, TITLE = {Mobile Base Station Placement and Energy Aware Routing in

Wireless Sensor Networks}, BOOKTITLE = {Proceeding of the IEEE Wireless Communications and

Networking Conference, WCNC 2006}, PAGES = {264--269}, YEAR = 2006, VOLUME = 1, ADDRESS = {Las Vegas, NV}, MONTH = {April 3--6}}

@InProceedings{BaatzBFMSK02, AUTHOR = {Baatz, S. and Bieschke, C. and Frank, M. and Martini, P.

and Scholz, C. and K\"{u}hl, C.}, TITLE = {Building Efficient {B}luetooth Scatternet Topologies from

$1$-factors}, BOOKTITLE = {Proceedings of WOC 2002}, PAGES = {}, YEAR = {2002}}

@InProceedings{BaatzFKMS02, AUTHOR = {Baatz, S. and Frank, M. and Kuhl, C. and Martini, P. and

Scholz, C.}, TITLE = {{B}luetooth Scatternets: An Enhanced Adaptive Scheduling

Scheme}, BOOKTITLE = {Proceedings of IEEE Infocom 2002}, PAGES = {782--790}, YEAR = {2002}, VOLUME = {2}, ADDRESS = {New York, NY}, MONTH = {June 23--27}}

@Article{BaconBH97, AUTHOR = {Bacon, J. and Bates, J. and Halls, D.}, TITLE = {Location-oriented multimedia}, JOURNAL = {IEEE Personal Communications}, VOLUME = 4, NUMBER = 5, PAGES = {48--57}, MONTH = {October}, YEAR = 1997, ABSTRACT = {Location-oriented multimedia describes the integration of

location-awareness technology and mobile multimedia applications. Application mobility is targeted at users rather than hosts. Since much complex execution and user interface state is set up in the course of application sessions, it is useful to be able to retain this transparently after moving an application. Distributed multimedia complicates this problem since many users can be involved, each with distributed media sources and sinks connected to one another. These communication channels must be reestablished after movement. The authors first present a flexible framework, the components of which provide the building blocks for a wide range of location-oriented application support architectures. The issues of location awareness, use of mobile agents, mobile multimedia endpoints, mobile object location, and communication systems are addressed. Second, the authors present a specific architecture that integrates these components to support location-oriented multimedia. In this architecture, mobile agents are used as controllers of multimedia sessions. The mobile agent system has been made location-aware so that applications can move to user locations and even follow users. Mobile multimedia endpoints support the reestablishment of distributed multimedia streams after movement (24 Refs.)}

}

@InProceedings{BadiaMPSZ06, AUTHOR = {Badia, L. and Mastrogiovanni, M. and Petrioli, C. and

Stefanakos, S. and Zorzi, M.}, TITLE = {An Optimization Framework for Joint Sensor Deployment,

Link Scheduling and Routing in Underwater Sensor Networks}, BOOKTITLE = {Proceedings of the First ACM International Workshop on

UnderWater Networks, WuWNet 2006}, YEAR = {2006}, ADDRESS = {Los Angeles, CA},

MONTH = {September 25}}

@Article{BagrodiaL94, AUTHOR = {Bagrodia, R. L. and Liao, W.-T.}, TITLE = {Maisie: a Language for the Design of Efficient

Discrete-Event Simulations}, JOURNAL = {IEEE Transactions on Software Engineering}, VOLUME = 20, NUMBER = 4, PAGES = {225--238}, MONTH = {April}, YEAR = 1994, ABSTRACT = {Maisie is a C-based discrete-event simulation language

that was designed to cleanly separate a simulation model from the underlying algorithm (sequential or parallel) used for the execution of the model. With few modifications, a Maisie program may be executed by using a sequential simulation algorithm, a parallel conservative algorithm or a parallel optimistic algorithm. The language constructs allow the run- time system to implement optimizations that reduce recomputation and state saving overheads for optimistic simulations and synchronization overheads for conservative implementations. This paper presents the Maisie simulation language, describes a set of optimizations, and illustrates the use of the language in the design of efficient parallel simulations (35 Refs.)}

}

@Article{BahlAPW04, AUTHOR = {Bahl, P. and Adya, A. and Padhye, J. and Wolman, A.}, TITLE = {Reconsidering Wireless Systems with Multiple Radios}, JOURNAL = {ACM SIGCOMM Computer Communications Review}, YEAR = {2004}, VOLUME = {34}, NUMBER = {5}, PAGES = {39--46}, MONTH = {October}}

@InCollection{BaiH06, AUTHOR = {Bai, F. and Helmy, A.}, TITLE = {A Survey of Mobility Models in Wireless Adhoc Networks}, BOOKTITLE = {Wireless Ad Hoc and Sensor Networks}, PAGES = {275--300}, PUBLISHER= {Springer},

YEAR = {2006}, EDITOR = {}, CHAPTER = {}, ADDRESS = {}, MONTH = {October}}

@Article{BakerE81, AUTHOR = {Baker, D. J. and Ephremides, A.}, TITLE = {The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm}, JOURNAL = {IEEE Transactions on Communications}, VOLUME = {COM-29}, NUMBER = 11, PAGES = {1694--1701}, MONTH = {November}, YEAR = 1981, ABSTRACT = {The authors consider the problem of organizing a set of

mobile, radio-equipped nodes into a connected network. They require that a reliable structure be acquired and maintained in the face of arbitrary topological changes due to node motion and/or failure. They also require that such a structure be achieved without the use of a central controller. A self-starting, distributed algorithm that establishes and maintains such a connected architecture is proposed and developed. This algorithm is especially suited to the needs of the HF Intra-Task Force (ITF) communication network, which is discussed in the paper. (11 References).}

}

@Article{BakerEF84, AUTHOR = {Baker, D. J. and Ephremides, A. and Flynn, J. A.}, TITLE = {The design and simulation of a mobile radio network with distributed control}, JOURNAL = {IEEE Journal on Selected Areas in Communications}, VOLUME = {SAC-2}, NUMBER = 1, PAGES = {226--237}, MONTH = {January}, YEAR = 1984, ABSTRACT = {A new architecture for mobile radio networks, called the

linked cluster architecture, is described, and methods for implementing this architecture using distributed control techniques are presented. The authors illustrate how fully distributed control methods can be combined with

hierarchical control to create a network that is robust with respect to both node loss and connectivity changes. Two distributed algorithms are presented that deal with the formation and linkage of clusters and the activation of the network links. To study the performance of the network structuring algorithms, a simulation model was developed. The use of SIMULA to construct software simulation tools is illustrated. Simulation results are shown for the example of a high-frequency intratask-force communication network (21 Refs.)}

}

@InProceedings{BakerWE82, AUTHOR = {Baker, D. J. and Wieselthier, J. and Ephremides, A.}, TITLE = {A Distributed Algorithm for Scheduling the Activation of

Links in a Self-organizing, Mobile, Radio Network}, BOOKTITLE = {Proceedings of the IEEE International Conference on

Communications, ICC 1982}, VOLUME = 1, PAGES = {2F.6.1--2F.6.5}, ADDRESS = {Philadelphia, PA}, MONTH = {June 13--17}, YEAR = 1982, ABSTRACT = {Describes a distributed algorithm for activating

communication links in a self-organizing, mobile, radio- linked network. Spread spectrum, code division multiple access (CDMA) signaling is assumed. Furthermore, one assumes that equipment limitations prevent nodes from receiving simultaneously on all possible code channels, thus requiring that nodes coordinate channel usage. The algorithm permits each node in the network to form its own, unique schedule for communicating with its neighbors. Scheduling conflicts are avoided without recourse to a central controller. The algorithm accommodates both one-way and two-way communication channels. Provisions are made for monitoring the network and adjusting schedules to compensate for changing network connectivities and loss of nodes. Broadcast, point-to-point, and random access modes of communicating are supported (4 Refs.)}

}

@InProceedings{BaldoMMRZ07, AUTHOR = {Baldo, N. and Maguolo, F. and Miozzo, M. and Rossi, M. and Zorzi, M.}, TITLE = {ns2-{MIRACLE}: A Modular Framework for Multi-technology and Cross-layer Support in Network Simulator~2},

BOOKTITLE = {Proceedings of the $2$nd International Conference on Performance Evaluation Methodologies and Tools, ValueTools 2007}, PAGES = {1--8}, ADDRESS = {Nantes, France}, MONTH = {October 23--25}, YEAR = 2007}

@InProceedings{BallardieFC93, AUTHOR = {Ballardie, T. and Francis, P. and Crowcroft, J.}, TITLE = {Core Based Trees (CBT): An Architecture for Scalable Inter-Domain Multicast Routing}, BOOKTITLE = {Proceedings of the ACM SIGCOMM'93, Communications Architectures, Protocols and Applications. Also Computer Communication Review, vol.23, no.4, Oct. 1993}, PAGES = {85--95}, ADDRESS = {San Francisco, CA}, MONTH = {13--17 September}, YEAR = 1993, ABSTRACT = {One of the central problems in one-to-many wide-area

communications is forming the delivery tree-the collection of nodes and links that a multicast packet traverses. Significant problems remain to be solved in the area of multicast tree formation, the problem of scaling being paramount among these. The authors show how the current IP multicast architecture scales poorly (by scale poorly, they mean consume too much memory, bandwidth, or too many processing resources), and subsequently present a multicast protocol based on a new scalable architecture that is low-cost, relatively simple, and efficient. They also show how this architecture is decoupled from (though dependent on) unicast routing, and is therefore easy to install in an internet that comprises multiple heterogeneous unicast routing algorithms. (15 References).}

}

@Article{BallD83, AUTHOR = {Ball, M. O. and Derigs, U.}, TITLE = {An Analysis of Alternative Strategies for Implementing

Matchings Algorithms}, JOURNAL = {Networks}, VOLUME = {13}, PAGES = {517--549}, MONTH = {January}, YEAR = 1983}

@InProceedings{BandyopadhyayC03a, AUTHOR = {Bandyopadhyay, S. and Coyle, E. J.}, TITLE = {Minimizing Communication Costs in Hierarchically Clustered

Networks of Wireless Sensors}, BOOKTITLE = {Proceedings of the IEEE Wireless Communications and

Networking Conference (WCNC 2003)}, PAGES = {1274--1279}, YEAR = {2003}, VOLUME = {2}, ADDRESS = {New Orleans, LA}, MONTH = {March 16--20}}

@InProceedings{BandyopadhyayC03b, AUTHOR = {Bandyopadhyay, S. and Coyle, E. J.}, TITLE = {An Energy Efficient Hierarchical Clustering Algorithm for

Wireless Sensor Networks}, BOOKTITLE = {Proceedings of the $22$ns IEEE Infocom 2003}, PAGES = {1713--1723}, YEAR = {2003}, VOLUME = {3}, ADDRESS = {San Francisco}, MONTH = {March 31--April 3}}

@InProceedings{BanerjeeK01, AUTHOR = {Banerjee, S. and Khuller, S.}, TITLE = {A Clustering Scheme for Hierarchical Control in Multi-hop

Wireless Networks}, BOOKTITLE = {Proceedings of the $20$th IEEE Infocom 2001}, PAGES = {1028--1037}, YEAR = {2001}, VOLUME = {2}, ADDRESS = {Anchorage, AK}, MONTH = {April 22--26}}

@Article{BannaiI73, AUTHOR = {Bannai, E and Ito, T.}, TITLE = {On Finite {M}oore Graphs}, JOURNAL = {J. Fac. Sci. Univ. Tokyo, Sect. IA, Math.}, VOLUME = 20, PAGES = {191--208}, YEAR = 1973}

@InProceedings{BaoG03, AUTHOR = {Bao, L. and Garcia-Luna-Aceves, J. J.}, TITLE = {Topology Management in Ad Hoc Networks}, BOOKTITLE = {Proceedings of the $4$th ACM International Symposium on

Mobile Ad Hoc Networking and Computing, MobiHoc 2003}, PAGES = {129--140}, YEAR = {2003}, ADDRESS = {Annapolis, MD}, MONTH = {June 1--3}}

@Article{Bar-NoyKN96, AUTHOR = {Bar-Noy, A. and Kessler, I. and Naghshineh, M.}, TITLE = {Topology-Based Tracking Strategies for Personal

Communication Networks}, JOURNAL = {Mobile Networks and Applications (MONET)}, VOLUME = 1, NUMBER = 1, PAGES = {49--56}, MONTH = {August}, YEAR = 1996, NOTE = {From here on from the SBIR99 part}, ABSTRACT = {This paper explores tracking strategies for mobile users

in personal communication networks which are based on the topology of the cells. We introduce the notion of topology based strategies in a very general form. In particular, the known paging areas, overlapping paging areas, reporting centers, and distance-based strategies are covered by this notion. We then compare two topology-based strategies with the time-based strategy on the line and mesh cell topology (8 Refs.)}

}

@Article{Bar-NoyKS95, AUTHOR = {Bar-Noy, A. and Kessler, I. and Sidi, M.}, TITLE = {Mobile Users: to Update or Not to Update?}, JOURNAL = {Wireless Networks}, VOLUME = 1, NUMBER = 2, PAGES = {175--185}, YEAR = 1995, ABSTRACT = {Tracking strategies for mobile users in wireless networks

are studied. In order to save the cost of using the wireless links mobile users should not update their location whenever they cross boundaries of adjacent cells.

This paper focuses on three natural strategies in which the mobile users make the decisions when and where to update: the time-based strategy, the number of movements-based strategy, and the distance-based strategy. We consider both memoryless movement patterns and movements with Markovian memory along a topology of cells arranged as a ring. We analyze the performance of each one of the three strategies under such movements, and show the performance differences between the strategies (9)}

}

@Article{Bar-YehudaGI92, AUTHOR = {{Bar-Yehuda}, R. and Goldreich, O. and Itai, A.}, TITLE = {On the Time-Complexity of Broadcast in Multi-Hop Radio

Networks: an Exponential Gap between Determinism and Randomization},

JOURNAL = JCSS, VOLUME = 45, NUMBER = 1, PAGES = {104--126}, MONTH = {August}, YEAR = 1992, ABSTRACT = {The time-complexity of deterministic and randomized

protocols for achieving broadcast (distributing a message from a source to all other nodes) in arbitrary multi-hop radio networks is investigated. In many such networks, communication takes place in synchronous time-slots. A processor receives a message at a certain time-slot if exactly one of its neighbors transmits at that time-slot. The authors assume no collision-detection mechanism; i.e. it is not always possible to distinguish the case where no neighbor transmits from the case where several neighbors transmit simultaneously. They present a randomized protocol that achieves broadcast in time which is optimal up to a logarithmic factor. In particular, with probability 1- epsilon , the protocol achieves broadcast within O((D+log n/ epsilon ).log n) time-slots, where n is the number of processors in the network and D its diameter. On the other hand, they prove a linear lower bound on the deterministic time-complexity of broadcast in this model. Namely, they show that any deterministic broadcast protocol requires Theta (n) time-slots, even if the network has diameter three, and n is known to all processors. These two results demonstrate an exponential gap in complexity between randomization and determinism (20 Refs.)}

}

@Article{BaratzJ86, AUTHOR = {Baratz, A. E. and Jaffe, J. M.}, TITLE = {Establishing Virtual Circuit in Large Computer Networks}, JOURNAL = CNISDN, VOLUME = 12, NUMBER = 1, PAGES = {27--37}, MONTH = {August}, YEAR = 1986, ABSTRACT = {Network routing algorithms generally attempt to provide

communication between two nodes by sending data messages along the best or shortest path between them. Unfortunately, in large networks it is difficult to maintain knowledge of such paths due to the cost in storage, computation, and communication bandwidth. In an attempt to solve this problem the technique of clustering has been proposed. Clustering generally reduces the cost of routing of by sacrificing optimality. Kamoun (1976, 1977) has shown that this sacrifice is asymptotically negligible under certain strong assumptions. A new clustering technique which permits one to obtain optimal paths is proposed. However, determining these paths requires some effort and thus the methodology is appropriate only if the paths are then used for many messages in virtual circuit fashion. An application to planar networks gives a quantitative demonstration of obtaining optimal paths with reduced path determination cost (16 Refs.)}

}

@InProceedings{BarsiNP09, AUTHOR = {Barsi, F. and Navarra, A. and Pinotti, M. C.}, TITLE = {Cheapest Paths in Multi-Interface Networks}, BOOKTITLE = {Proceedings of the $10$th International Conference on

Distributed Computing and Networking, ICDCN, 2009}, YEAR = {2009}, ADDRESS = {Gachibowli Hyderabad, India}, MONTH = {January 3--6}}

@InProceedings{BartoliniCL09, AUTHOR = {Bartolini, N. and Calamoneri, T. and La Porta, T. F. and Nassimi, A. and Sivestri, S.}, TITLE = {Autonomous Deployment of Heterogeneous Mobile Sensors}, BOOKTITLE = {Proceedings of the $17$th International Conference on Network Protocols, ICNP 2009},

PAGES = {42--51}, YEAR = {2009}, ADDRESS = {Princeton, NJ}, MONTH = {October 13--16}}

@InProceedings{BaruahUK04, AUTHOR = {Baruah, P. and Urgaonkar, R. and Krishnamachari, B.}, TITLE = {Learning-Enforced Time Domain Routing to Mobile Sinks in

Wireless Sensor Fields}, BOOKTITLE = {Proceedings of the $29$th Annual IEEE International

Conference on Local Computer Networks, LCN 2004}, PAGES = {525--532}, YEAR = {2004}, ADDRESS = {Tampa, FL}, MONTH = {November 16--18}}

@InProceedings{BasuKL01, AUTHOR = {Basu, P. and Khan, N. and Little, T. D. C.}, TITLE = {A Mobility Based Metric for Clustering in Mobile Ad Hoc

Networks}, BOOKTITLE = {Proceedings of the International Workshop on Wireless

Networks and Mobile Computing, WNMC 2001}, PAGES = {413--418}, YEAR = {2001}, ADDRESS = {Mesa, AZ}, MONTH = {April 16}}

@InProceedings{BeadleMS97, AUTHOR = {Beadle, H. W. P. and Maguire, Jr., C. Q. and Smith, M.

T.}, TITLE = {Using Location and Environment Awareness in Mobile

Communications}, BOOKTITLE = {Proceedings of ICICS, 1997 International Conference on

Information, Communications and Signal Processing}, PAGES = {1781--1785}, VOLUME = 3, ADDRESS = {Singapore}, MONTH = {September}, YEAR = 1997, ABSTRACT = {We are investigating the use of badge based wearable

computers to create highly mobile location and environment aware systems. When coupled to intelligent servers the badges provide an unparalleled platform for human centred

information environments. This paper describes the architecture of the badge, its distributed computing environment, and presents initial results of application development trials conducted by a class of telecommunications students at KTH (21 Refs.)}

}

@Article{Belding-Royer02, AUTHOR = {Belding-Royer, E. M.}, TITLE = {Multi-Level Hierarchies for Scalable Ad Hoc Routing}, JOURNAL = {ACM/Kluwer Wireless Networks}, YEAR = {2003}, VOLUME = {9}, NUMBER = {5}, PAGES = {461--478}, MONTH = {September}}

@Article{Belding-Royer03, AUTHOR = {Belding-Royer, E. M.}, TITLE = {Hierarchical Routing in Ad Hoc Mobile Networks}, JOURNAL = {Wiley InterSicence Wireless Communications \& Mobile

Computing, Special issue on Mobile Ad Hoc Networking---Research, Trends and Applications, S.~Basagni and S.J.~Lee, editors},

YEAR = {2002}, VOLUME = {2}, NUMBER = {5}, PAGES = {515--532}, MONTH = {August}}

@InCollection{Belding-Royer04, AUTHOR = {Belding-Royer, E. M.}, TITLE = {Routing Approaches in Mobile Ad Hoc Networks}, BOOKTITLE = {Mobile Ad Hoc Networking}, PAGES = {275--300}, PUBLISHER= {IEEE Press and John Wiley \& Sons, Inc.}, YEAR = {2004}, EDITOR = {Basagni, S. and Conti, M. and Giordano, S. and Stojmenovic, I.}, CHAPTER = {10}, ADDRESS = {Piscataway, NJ and Hoboken, NJ}, MONTH = {April}}

@Article{Benders62,

AUTHOR = {Benders, J. F.}, TITLE = {Partitioning Procedures for Solving Mixed Variables Programming Problems}, JOURNAL = {Numerische Mathematik}, YEAR = {1962}, VOLUME = {4}, PAGES = {238--252}}

@Book{Berge85, AUTHOR = {C. Berge}, TITLE = {Graphs and Hypergraphs}, PUBLISHER= {North--Holland}, YEAR = 1985}

@InProceedings{BernsenM08, AUTHOR = {Bernsen, J. and Manivannan, D.}, TITLE = {Greedy Routing Protocols for Vehicular Ad Hoc Networks}, BOOKTITLE = {Proceedings of the International Wireless Communications

and Mobile Computing Conference, IWCMC 2008}, PAGES = {632--637}, YEAR = {2008}, ADDRESS = {Crete Island, Greece}, MONTH = {August 6--8}}

@Book{BertsekasG92, AUTHOR = {Bertsekas, D. and Gallager, R.}, TITLE = {Data Networks}, EDITION = {Second}, PUBLISHER= {Prentice Hall}, ADDRESS = {Englewood Cliffs, NJ}, YEAR = 1992}

@InProceedings{Bettstetter04, AUTHOR = {Bettstetter, C.}, TITLE = {The Cluster Density of a Distributed Clustering Algorithm

in Ad Hoc Networks}, BOOKTITLE = {Proceeding of the IEEE International Conference on

Communications, ICC 2004}, PAGES = {4336--4340}, YEAR = {2004}, VOLUME = {7}, ADDRESS = {Paris, France},

MONTH = {June 20--24}}

@InProceedings{BettstetterF03, AUTHOR = {Bettstetter, C. and Friedrich, B.}, TITLE = {Time and Message Complexity of the Generalized Distributed

Mobility Adaptive Clustering ({GDMAC}) Algorithm in Wireless MultiHop Networks},

BOOKTITLE = {Proceeding of the $57$th IEEE Semiannual Vehicular Technology Conference, VTC 2003-Spring},

PAGES = {176--180}, YEAR = {2003}, VOLUME = {1}, ADDRESS = {Jeju, Korea}, MONTH = {April 22--25}}

@InProceedings{BettstetterK01, AUTHOR = {Bettstetter, C. and Krauser, R.}, TITLE = {Scenario-based Stability Analysis of the Distributed

Mobility-adaptive Clustering ({DMAC}) Algorithm}, BOOKTITLE = {Proceedings of the $2$nd ACM International Symposium on

Mobile Ad Hoc Networking and Computing, MobiHoc 2001}, PAGES = {232--241}, YEAR = {2001}, ADDRESS = {Long Beach, CA}, MONTH = {October 4--5}}

@Unpublished{BhagwatR00, AUTHOR = {Bhagwat, P. and Rao, S. P.}, TITLE = {On the Characterization of {B}luetooth Scatternet

Topologies}, NOTE = {http://www.winlab.rutgers.edu/~pravin/bluetooth/index.html}

, YEAR = {2000}}

@Article{Bharghavan+94, AUTHOR = {Bharghavan, V. and al.}, TITLE = {{MACAW}: A Media Access Protocol for Wireless {LAN}s}, JOURNAL = {ACM Computer Communication Review}, YEAR = {1994}, VOLUME = {24}, NUMBER = {4}, PAGES = {212--225},

MONTH = {October}}

@Book{Birkoff73, AUTHOR = {Birkoff, G.}, TITLE = {Lattice Theory}, PUBLISHER= {American Mathematical Society Colloq. Publ.}, VOLUME = 25, YEAR = 1973}

@Article{BirkY97, AUTHOR = {Birk, Y. and Nachman, Y.}, TITLE = {Using Direction and Elapsed-Time Information to Reduce the

Wireless Cost of Locating Mobile Units in Cellular Networks},

JOURNAL = {Wireless Networks}, VOLUME = 1, NUMBER = 4, PAGES = {403--412}, MONTH = {December}, YEAR = 1997}

@Book{BlueHoc, AUTHOR = {IBM}, TITLE = {{BlueHoc}: {B}luetooth Ad Hoc Network Simulator, Version

1.0}, PUBLISHER= {http://www-124.ibm.com/developerworks/projects/bluehoc}, MONTH = {June}, YEAR = {2001}}

@Book{Bluetooth, AUTHOR = {http://www.bluetooth.com}, TITLE = {Specification of the {B}luetooth System, Volume 1, Core}, PUBLISHER= {Version 2.0 + EDR}, MONTH = {November 8}, YEAR = {2004}}

@InCollection{BlumDTC05, AUTHOR = {Blum, J. and Ding, M. and Thaeler, A. and Cheng, X.}, TITLE = {Connected Dominating Sets in Sensor Networks and

{MANET}s}, BOOKTITLE = {Handbook of Combinatorial Optimization},

PAGES = {329--369}, PUBLISHER= {Kluwer Academic Publisher}, YEAR = {2004}, EDITOR = {Du, D.-Z. and Pardalos, P. M.}, VOLUME = {1}}

@Book{Bollobas01, AUTHOR = {Bollob\'{a}s, B.}, TITLE = {Random Graphs}, EDITION = {second}, SERIES = {Cambridge Studies in Advanced Mathematics}, NUMBER = 73, PUBLISHER= {Cambridge University Press}, ADDRESS = {Cambridge, UK}, YEAR = 2001}

@Book{Bollobas79, AUTHOR = {Bollob\'{a}s, B.}, TITLE = {Graph Theory. An Introductory Course}, PUBLISHER= {Springer}, ADDRESS = {New York, NY}, YEAR = 1979}

@Book{Bollobas85, AUTHOR = {Bollob\'{a}s, B.}, TITLE = {Random Graphs}, PUBLISHER= {Academic Press, Inc.}, ADDRESS = {London, UK}, YEAR = 1985}

@Book{Bollobas98, AUTHOR = {Bollob\'{a}s, B.}, TITLE = {Modern Graph Theory}, SERIES = {Graduate Text in Mathematics}, NUMBER = 184, PUBLISHER= {Springer}, ADDRESS = {New York, NY}, YEAR = 1998}

@Article{BollobasT85, AUTHOR = {Bollob\'{a}s, B. and Thomason, A. G.},

TITLE = {Random Graphs of Small Order}, JOURNAL = {Random Graphs. Annals of Discrete Mathematics}, PAGES = {47--97}, YEAR = {1985}}

@Article{BoseMSU01, AUTHOR = {Bose, P. and Morin, P. and Stojmenovic, I. and Urrutia,

J.}, TITLE = {Routing with Guaranteed Delivery in Ad Hoc Wireless

Networks}, JOURNAL = {ACM/Kluwer Wireless Networks}, VOLUME = 7, NUMBER = 6, PAGES = {609--616}, YEAR = {2001}, MONTH = {November}}

@InProceedings{BoseMSU99, AUTHOR = {Bose, P. and Morin, P. and Stojmenovic, I. and Urrutia,

J.}, TITLE = {Routing with Guaranteed Delivery in Ad Hoc Wireless

Networks}, BOOKTITLE = {Proceedings of the $3$rd International Workshop on

Discrete Algorithms and Methods for Mobile Computing and Communications, DIAL M '99},

YEAR = {1999}, PAGES = {48--55}, ADDRESS = {Seattle, WA}}

@InProceedings{BoukercheM07a, AUTHOR = {Boukerche, A. and Martirosyan, A.}, TITLE = {An Energy-aware and Fault Tolerant Inter-cluster

Communication-based Protocol for Wireless Sensor Networks}, BOOKTITLE = {Proceedings of the $50$th IEEE Global Communications

Conference, Globecom 2007}, YEAR = {2007}, ADDRESS = {Washington, DC}, MONTH = {November 26--30}}

@InProceedings{BoukercheM07b, AUTHOR = {Boukerche, A. and Martirosyan, A.}, TITLE = {An Energy Efficient and Low Latency Multiple Events'

Propagation Protocol for Wireless Sensor Networks with Multiple Sinks},

BOOKTITLE = {Proceedings of the $4$th ACM Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor and Ubiquitous Networks, PE-WASUN 2007},

YEAR = 2007, ISBN = {978-1-59593-808-4}, PAGES = {82--86}, ADDRESS = {Chania, Crete Island, Greece}, DOI = {http://doi.acm.org/10.1145/1298197.1298213}}

@Article{Boztas95, AUTHOR = {Boztas, S.}, TITLE = {A robust multi-priority topology-independent transmission

schedule for packet radio networks}, JOURNAL = IPL, VOLUME = 55, NUMBER = 5, PAGES = {291--295}, YEAR = {1997}, MONTH = {September 15}, ABSTRACT = {I. Chlamtac and A. Farago (1994) have introduced a

transmission scheduling (TS) algorithm called the (proper robust scheduling) PRS algorithm, which works for an arbitrary network topology with N stations and maximum degree D and produces a schedule of length L=o(N). They use polynomials over GF(q) to achieve this. A generalization of their algorithm, called multi level (ML-)PRS is introduced here which makes use of the subfield structure of GF(q) to support multiple classes of users, with different transmission characteristics (3 Refs.)}

}

@Book{BrayS02, AUTHOR = {Bray, J. and Sturman, C. F.}, TITLE = {Bluetooth 1.1: Connect Without Cables}, PUBLISHER= {Prentice Hall PTR}, YEAR = {2002}, ADDRESS = {Upper Saddle River, NJ}, EDITION = {second}, MONTH = {January 3}}

@InProceedings{BrochMJHJ98, AUTHOR = {Broch, J. and Maltz, D. A. and Johnson, D. B. and Hu,

Y.-C. and Jetcheva, J.}, TITLE = {A Performance Comparison of Multi-Hop Wireless Ad Hoc

Network Routing Protocols}, BOOKTITLE = {Proceedings of the $4$th Annual ACM/IEEE International


PAGES = {85--97}, YEAR = {1998}, ADDRESS = {Dallas, TX}, MONTH = {October 25--30}}

@Article{BrooksRS03, AUTHOR = {Brooks, R. and Ramanathan, P. and Sayeed, A.}, TITLE = {Distributed Target Classification and Tracking in Sensor

Networks}, JOURNAL = {Proceedings of the IEEE}, YEAR = {2003}, VOLUME = {91}, NUMBER = {8}, PAGES = {1163--1171}, MONTH = {August}}

@Article{BrunoCG05, AUTHOR = {Bruno, R. and Conti, M. and Gregori, E.}, TITLE = {Mesh Networks: Commodity Multi-Hop Ad Hoc Networks}, JOURNAL = {IEEE Communication Magazine}, YEAR = {March}, VOLUME = {43}, NUMBER = {3}, PAGES = {123--131}, OPTMONTH = {March}}

@Article{BruschiD97, AUTHOR = {Bruschi, D. and Del Pinto, M.}, TITLE = {Lower Bounds for the Broadcast Problem in Mobile Radio

Networks}, JOURNAL = DC, VOLUME = 10, NUMBER = 3, PAGES = {129--135}, YEAR = {April 1997}}

@Article{BulusuHE00, AUTHOR = {Bulusu, N. and Heidemann, J. and Estrin, D.}, TITLE = {{GPS}-Less Low Cost Outdoor Localization for Very Small

Devices}, JOURNAL = {IEEE Personal Communications Magazine}, YEAR = {2000}, VOLUME = {7}, NUMBER = {5}, PAGES = {28--34}, MONTH = {October}}

@Misc{BulusuHE00tr, AUTHOR = {Bulusu, N. and Heidemann, J. and Estrin, D.}, TITLE = {{GPS}-less Low Cost Outdoor Localization for Very Small

Devices}, NOTE = {Technical Report 00-729, University of Southern

California}, MONTH = {April}, YEAR = {2000}, URL = {http://citeseer.nj.nec.com/bulusu00gpsless.html}}

@InProceedings{BulusuHE01, AUTHOR = {Bulusu, N. and Heidemann, J. and Estrin, D.}, TITLE = {Adaptive Beacon Placement}, BOOKTITLE = {Proceedings of the $21$st International Conference on

Distributed Computing Systems, ICDCS 2001}, PAGES = {489--498}, YEAR = {2001}, ADDRESS = {Phoenix (Mesa), AZ}, MONTH = {April 16--19}}

@Book{Callaghan93, AUTHOR = {Callaghan, S.}, TITLE = {GPS navigation message timing references}, PUBLISHER= {Steven Callaghan}, ADDRESS = {Garden Grove, CA}, YEAR = {1993}}

@Book{Callaway03, AUTHOR = {Callaway, Jr., E. H.}, TITLE = {Wireless Sensor Networks: Architectures and Protocols}, PUBLISHER= {Auerbach Publications},

YEAR = {2003}, ADDRESS = {Boca Raton, FL}, MONTH = {August}}

@Article{CamilloNPRZ12, AUTHOR = {Camill\ò, A. and Nati, M. and Petrioli, C. and Rossi, M. and Zorzi, M.}, TITLE = {{IRIS}: Integrated Data Gathering and Interest Dissemination System for Wireless Sensor Networks}, JOURNAL = {Ad Hoc Networks, Special Issue Special Issue on Cross-Layer Design in Ad Hoc and Sensor Networks, L.~Galluccio, K.~Nahrstedt, and V.~R.~Syrotiuk, eds.}, YEAR = {2012}, NOTES = {To appear}}

@Article{CampBD02, AUTHOR = {Camp, T. and Boleng, J. and Davies, V.}, TITLE = {A Survey of Mobility Models for Ad Hoc Network Research}, JOURNAL = {Wiley Interscience Wireless Communications \& Mobile

Computing, Special Issue on Mobile Ad Hoc Networking: Research Trend and Application, S.~Basagni and S.J.~Lee, eds.},


@InProceedings{CampBW02, AUTHOR = {Camp, T. and Boleng, J. and Wilcox, L.}, TITLE = {Location Information Services in Mobile Ad Hoc Networks}, BOOKTITLE = {Proceedings of the IEEE International Conference on

Communications, ICC 2002}, VOLUME = 5, PAGES = {3318--3324}, YEAR = {2002}, ADDRESS = {New York, NY}, MONTH = {April 28--May 2}}

@InProceedings{CasariMNPZ05, AUTHOR = {Casari, P. and Marcucci, A. and Nati, M. and Petrioli, C.

and Zorzi, M},

TITLE = {A Detailed Simulation Study of Geographic Random Forwarding ({GeRaF}) in Wireless Sensor Networks},

BOOKTITLE = {Proceedings of the IEEE Military Communications Conference, MILCOM 2005},

VOLUME = {1}, PAGES = {59--68}, YEAR = {2005}, ADDRESS = {Atlantic City, NJ}, MONTH = {October, 17--20}}

@InProceedings{CasariMZ07, AUTHOR = {Casari, P. and Marella, S. and Zorzi, M.}, TITLE = {On Multiple Access in Clustered Underwater Acoustic Sensor

Networks}, BOOKTITLE = {Proceedings of MTS/IEEE OCEANS 2007}, YEAR = {2007}}

@InProceedings{CasariNPZ06, AUTHOR = {Casari, P. and Nati, M. and Petrioli, C. and Zorzi, M.}, TITLE = {{ALBA}: An Adaptive Load--balanced Algorithm for

Geographic Forwarding in Wireless Sensor Networks}, BOOKTITLE = {Proceedings of the $25$th IEEE Military Communication

Conference, MILCOM 2006}, PAGES = {1--9}, MONTH = {October 23--25}, YEAR = {2006}, ADDRESS = {Washington, DC}}

@InProceedings{CasariNPZ06a, AUTHOR = {Casari, P. and Nati, M. and Petrioli, C. and Zorzi, M}, TITLE = {Geographic Forwarding and Adaptive Load Balancing in

Wireless Sensor Networks}, BOOKTITLE = {Poster at ACM/SIGMOBILE MobiCom 2006}, YEAR = {2006}, ADDRESS = {Los Angeles, CA}, MONTH = {September 24--29}}

@InProceedings{CasariNPZ07, AUTHOR = {Casari, P. and Nati, M. and Petrioli, C. and Zorzi, M.}, TITLE = {Efficient Non-planar Routing Around Dead Ends in Sparse

Topologies using Random Forwarding}, BOOKTITLE = {Proceedings of the IEEE International Conference on

Communications, ICC 2007}, YEAR = {2007}, MONTH = {June 24--28}, ADDRESS = {Glasgow, Scotland}}

@InProceedings{CastanedaD99, AUTHOR = {Castaneda, R. and Das, S. R.}, TITLE = {Query Localization Techniques for On-Demand Routing

Protocols in Ad Hoc Networks}, BOOKTITLE = {Proceedings of the Fifth Annual ACM/IEEE International

Conference on Mobile Computing and Networking, MobiCom'99}, PAGES = {186--194}, ADDRESS = {Seattle, WA}, MONTH = {15--20 August}, YEAR = 1999}

@InProceedings{CavalcantiGA05, AUTHOR = {Cavalcanti, D. and Gossain, H. and Agrawal, D.}, TITLE = {Connectivity in Multi-radio, Multi-channel Heterogeneous

Ad Hoc Networks}, BOOKTITLE = {Proceedings of the $16$th IEEE International Symposium on

Personal, Indoor, Mobile Radio Communications, PIMRC 2005}, PAGES = {1322--1326}, YEAR = {2005}, VOLUME = {2}, ADDRESS = {Berlin, Germany}, MONTH = {September 11--14}}

@InProceedings{CerpaE02, AUTHOR = {Cerpa, A. and Estrin, D.}, TITLE = {{ASCENT}: {A}daptive {S}elf-{C}onfiguring s{E}nsor

{N}etworks {T}opologies}, BOOKTITLE = {Proceedings of the $21$st Annual Joint Conference of the

IEEE Computer and Communications Societies, INFOCOM 2002}, PAGES = {1278--1287}, YEAR = {2002}, VOLUME = {3}, ADDRESS = {New York, NY}, MONTH = {June 23--27}}

@InProceedings{CeruttiFBRR01, AUTHOR = {Cerutti, I. and Fumagalli, A. and {de Barros}, M. X. and

Rajagopalan, R. and Rossi, S. M.}, TITLE = {Assessing the Effect of Polarization Mode Dispersion in

Multi-hop Multi-rate WDM Ring}, BOOKTITLE = {First Workshop on Photonic Networks and Technologies}, YEAR = {2001}, ADDRESS = {Scuola Superiore Sant'Anna, Pisa, Italy}, MONTH = {November 9}}

@InProceedings{CeruttiFP01, AUTHOR = {Cerutti, I. and Fumagalli, A. and Potasek, M. J.}, TITLE = {Chromatic Dispersion and Self-Phase Modulation in

Multi-Hop Multi-Rate {WDM} Rings}, BOOKTITLE = {Proceedings of the $39$th Annual Allerton Conference on

Communication, Control and Computing}, YEAR = {2001}, ADDRESS = {Monticello, IL}, MONTH = {October}}

@InProceedings{CeruttiFR01, AUTHOR = {Cerutti, I. and Fumagalli, A. and Rajagopalan, R.}, TITLE = {Effects of Polarization Mode Dispersion in Multi-Hop and

Multi-Rate Wavelength Division Multiplexing Rings}, BOOKTITLE = {Texas Systems day}, YEAR = {2001}, ADDRESS = {Lubbock, TX}, MONTH = {October}}

@InProceedings{ChakrabartiSA03, AUTHOR = {Chakrabarti, A. and Sabharwal, A. and Aazhang, B.}, TITLE = {Using Predictable Observer Mobility for Power Efficient

Design of Sensor Networks}, BOOKTITLE = {Proceedings of the Second International Workshop on

Information Processing in Sensor Networks, IPSN 2003}, PAGES = {129--145}, YEAR = {2003}, EDITOR = {Zhao, F. and Guibas, L.}, SERIES = {LNCS 2634}, ADDRESS = {Palo Alto, CA}, MONTH = {April 22--23}}

@Article{ChakrabartiSA05, AUTHOR = {Chakrabarti, A. and Sabharwal, A. and Aazhang, B.},

TITLE = {Data Collection by a Mobile Observer in A Single-hop Sensor Network},

JOURNAL = {ACM Transactions on Sensor Networks}, YEAR = {2005}, MONTH = {January}}

@InProceedings{ChandraBB04, AUTHOR = {Chandra, R. and Bahl, P. and Bahl, P.}, TITLE = {Multi-Net: Connecting to Multiple IEEE 802.11 Networks

Using a Single Wireless Card}, BOOKTITLE = {Proceedings of IEEE Infocom 2004}, YEAR = {2004}, ADDRESS = {Hong Kong, China}, MONTH = {March 7--11}}

@InProceedings{ChandrasekharSCE06, AUTHOR = {Chandrasekhar, V. and Seah, W. K. G. and Choo, Y. S. and

Ee, H.V.}, TITLE = {Localization in Underwater Sensor Networks---{S}urvey and

Challenges}, BOOKTITLE = {Proceedings of the First ACM International Workshop on

UnderWater Networks, WuWNet 2006}, YEAR = {2006}, ADDRESS = {Los Angeles, CA}, MONTH = {September 25}}

@InProceedings{ChangMM07, AUTHOR = {Chang, S.-H. and Merabti, M. and Mokhtar, H. M.}, TITLE = {Coordinate Magnetic Routing for Mobile Sinks Wireless

Sensor Networks}, BOOKTITLE = {Proceedings of the $21$st International Conference on

Advanced Information Networking and Applications Workshops, AINAW 2007},

YEAR = {2007}, VOLUME = 1, ADDRESS = {Niagara Falls, ON, Canada}, MONTH = {May 21--23}}

@Article{ChangT04, AUTHOR = {Chang, J.-H. and Tassiulas, L.}, TITLE = {Maximum Lifetime Routing in Wireless Sensor Networks}, JOURNAL = {IEEE Transactions on Networking},


@InProceedings{ChangT00, AUTHOR = {Chang, J.-H. and Tassiulas, L.}, TITLE = {Energy Conserving Routing in Wireless Ad Hoc Networks}, BOOKTITLE = {Proceedings of IEEE Infocom 2000}, YEAR = {2000}, VOLUME = 1, PAGES = {22--31}, ADDRESS = {Tel Aviv, Israel}, MONTH = {March 26--30}}

@InProceedings{ChanP04, AUTHOR = {Chan, H. and Perrig, A.}, TITLE = {ACE: An Emergent Algorithm for Highly Uniform Cluster

Formation}, BOOKTITLE = {Proceedings of the $1$st IEEE European Workshop on

Wireless Sensor Networks, EWSN 2004}, EDITOR = {Karl, H. and Willig, A. and Wolisz, A.}, PAGES = {154--171}, YEAR = {2004}, NUMBER = {2920}, SERIES = {LNCS}, ADDRESS = {Berlin, Germany}, MONTH = {January 19--21}}

@Book{ChartrandO93, AUTHOR = {Chartrand, G. and Oellermann, O. R.}, TITLE = {Applied and Algorithmic Graph Theory}, SERIES = {International Series in Pure and Applied Mathematics}, PUBLISHER= {McGraw-Hill, Inc.}, ADDRESS = {New York, NY}, YEAR = {1993}}

@InProceedings{ChatterjeeDT00, AUTHOR = {Chatterjee, M. and Das, S. K. and Turgut, D.}, TITLE = {An On-Demand Weighted Clustering Algorithm ({WCA}) for Ad

Hoc Networks}, BOOKTITLE = {Proceedings of IEEE Globecom 2000}, VOLUME = {3}, PAGES = {1697--1701}, ADDRESS = {San Francisco, CA}, MONTH = {November 27--December 1}, YEAR = 2000}

@Article{ChatterjeeDT02, AUTHOR = {Chatterjee, M. and Das, S. K. and Turgut, D.}, TITLE = {{WCA}: A Weighted Clustering Algorithm for Mobile Ad Hoc

Networks}, JOURNAL = {Journal of Cluster Computing, Special Issue on Mobile Ad

Hoc Networks}, YEAR = {2002}, VOLUME = {5}, NUMBER = {2}, PAGES = {193--204}, MONTH = {April}}

@InProceedings{ChatzigiannakisKN06, AUTHOR = {Chatzigiannakis, I. and Kinalis, A. and Nikoletseas, S.}, TITLE = {Sink Mobility Protocols for Data Collection in Wireless

Sensor Networks}, BOOKTITLE = {Proceedings of the $4$th ACM International Workshop on

Mobility Management and Wireless Access, MobiWac 2006}, YEAR = {2006}, ISBN = {1-59593-488-X}, PAGES = {52--59}, ADDRESS = {Terromolinos, Malaga, Spain}, DOI = {http://doi.acm.org/10.1145/1164783.1164793}, PUBLISHER= {ACM}, MONTH = {October 2}}

@InProceedings{ChatzigiannakisKNR07, AUTHOR = {Ioannis Chatzigiannakis and Athanasios Kinalis and Sotiris

Nikoletseas and Jose Rolim}, TITLE = {Fast and Energy Efficient Sensor Data Collection by

Multiple Mobile Sinks}, BOOKTITLE = {Proceedings of the $5$th ACM International Workshop on

Mobility Management and Wireless Access, MobiWac 2007}, YEAR = {2007}, ISBN = {978-1-59593-809-1},

PAGES = {25--32}, ADDRESS = {Chania, Crete Island, Greece}, DOI = {http://doi.acm.org/10.1145/1298091.1298097}, PUBLISHER= {ACM}, MONTH = {October 22}}

@InProceedings{ChatzigiannakisNS01, AUTHOR = {Chatzigiannakis, I. and Nikoletseas, S. and Spirakis, P.}, TITLE = {An Efficient Communication Strategy for Ad-hoc Mobile

Networks}, BOOKTITLE = {Proceedings of the Twentieth Annual ACM Symposium on

Principles of Distributed Computing, PODC 2001}, PAGES = {320--332}, YEAR = {2001}, ADDRESS = {Newport, RI}, MONTH = {August 26--29}}

@InProceedings{ChatzigiannakisNS02, AUTHOR = {Chatzigiannakis, I. and Nikoletseas, S.}, TITLE = {An Adaptive Compulsory Protocol for Basic Communications

in Highly Changing Ad-Hoc Mobile Networks}, BOOKTITLE = {Proceedings of the International Parallel and Distributed

Processing Symposium, {IPDPS 2002}}, PAGES = {193--202}, YEAR = {2002}, ADDRESS = {Fort Lauderdale, FL}, MONTH = {April 15--19}}

@InProceedings{ChengLPBZ02, AUTHOR = {Cheng, C. T and Lamberg, H. L. and Philip, S. J. and {van

der Berg}, E. and Zhang, T.}, TITLE = {{SLALoM}: A Scalable Location Management Scheme for Large

Mobile Ad-hoc Networks}, BOOKTITLE = {Proceedings of the 2002 IEEE Wireless Communication and

Networking Conference, WCNC 2002}, PAGES = {574--578}, VOLUME = 2, YEAR = {2002}, ADDRESS = {Orlando, FL}, MONTH = {March 17--21}}

@Article{ChengPH08, AUTHOR = {Cheng, Z. and Perillo, M. and Heinzelman, W. B.}, TITLE = {General Network Lifetime and Cost Models for Evaluating Sensor Network Deployment Strategies}, JOURNAL = {IEEE Transactions on Mobile Computing}, VOLUME = 7, NUMBER = 4, PAGES = {484--497}, MONTH = {April}, YEAR = 2008}

@Article{ChengRKG89, AUTHOR = {Cheng, C. and Riley, R. and Kumar, S. P. R. and

{Garcia-Luna-Aceves}, J. J.}, TITLE = {A Loop-free Extended Bellman-Ford Routing Protocol Without

Bouncing Effect}, JOURNAL = {Computer Communication Review}, VOLUME = 19, NUMBER = 4, PAGES = {224--236}, MONTH = {September}, YEAR = 1989}

@Article{ChengSLD08, AUTHOR = {Cheng, X. and Shu, H. and Liang, Q. and Du, D. H.-C.}, TITLE = {Silent Positioning in Underwater Acoustic Sensor Networks}, JOURNAL = {IEEE Transactions on Vehicular Technology}, VOLUME = 57, NUMBER = 3, PAGES = {1756--1766}, MONTH = {May}, YEAR = 2008}

@InProceedings{ChenHS03, AUTHOR = {Chen, W.-P. and Hou, J. C. and Sha, L.}, TITLE = {Dynamic Clustering for Acoustic Target Tracking in

Wireless Sensor Networks}, BOOKTITLE = {Proceedings of the $11$th IEEE International Conference on

Network Protocols, ICNP 2003}, PAGES = {284--294}, YEAR = {2003}, ADDRESS = {Atlanta, GA}, MONTH = {November 4--7}

}

@Article{ChenHS04, AUTHOR = {Chen, W.-P. and Hou, J. C. and Sha, L.}, TITLE = {Dynamic Clustering for Acoustic Target Tracking in

Wireless Sensor Networks}, JOURNAL = {IEEE Transactions on Mobile Computing}, YEAR = {2004}, VOLUME = {3}, NUMBER = {3}, PAGES = {258--271}, MONTH = {July}}

@Article{ChenJBM02, AUTHOR = {Chen, B. and Jamieson, K. and Balakrishnan, H. and Morris,

R.}, TITLE = {{SPAN}: An Energy Efficient Coordination Algorithm for

Topology Maintenance in Ad Hoc Wireless Networks}, JOURNAL = {ACM/Kluwer Wireless Networks}, YEAR = {2002}, VOLUME = {8}, NUMBER = {5}, PAGES = {481--494}, MONTH = {September}}

@InProceedings{ChenL03, AUTHOR = {Chen, Y. P. and Liestman, A. L.}, TITLE = {Approximating Minimum Size Weakly-Connected Dominating

Sets for Clustering Mobile Ad Hoc Networks}, BOOKTITLE = {Proceedings of the Third ACM International Symphosium on

Mobile Ad Hoc Networking and Computing, MobiHoc 2002}, PAGES = {157--164}, YEAR = {2002}, ADDRESS = {Lausanne, Switzerland}, MONTH = {June 9--11}}

@Article{ChenL03a, AUTHOR = {Chen, Y. P. and Liestman, A. L.}, TITLE = {A Zonal Algorithm for Clustering Ad Hoc Networks}, JOURNAL = {International Journal of Foundations of Computer Science}, YEAR = {2003}, VOLUME = {14}, NUMBER = {2},

PAGES = {305--322}, MONTH = {April}}

@Article{ChenL07, AUTHOR = {Chen, Y.-S. and Lin, T.-H.}, TITLE = {A Time-Slot Leasing-Based {QoS} Routing Protocol over

{B}luetooth {WPAN}s}, JOURNAL = {International Journal of Ad Hoc and Ubiquitous Computing,

Special Issue on Pervasive Computing Through Networked Sensing Devices, Lai et al., eds.},

YEAR = {2007}, VOLUME = {2}, NUMBER = {1/2}, PAGES = {92--108}}

@InProceedings{ChenMY06, AUTHOR = {Chen, C. and Ma, J. and Yu, K.}, TITLE = {Designing Energy-Efficient Sensor Networks with Mobile

Sinks}, BOOKTITLE = {Proceedings of the $1$st Workshop on World-Sensor-Web:

Mobile Device Centric Sensory Networks and Applications, WSW 2006},

YEAR = {2006}, ADDRESS = {Boulder, CO}, MONTH = {October 31}}

@Article{ChenV07, AUTHOR = {Chen, D. and Varshney, P. K.}, TITLE = {A Survey of Void Handling Techniques for Geographic Routing in Wireless Networks}, JOURNAL = {IEEE Communications Surveys}, YEAR = {2007}, VOLUME = {9}, NUMBER = {1}, PAGES = {50--67}, MONTH = {First Quarter}}

@InProceedings{ChevallayVDH02, AUTHOR = {Chevallay, C. and Van Dyck, R. E. and Hall, T. A.}, TITLE = {Self-Organization Protocols for Wireless Sensor Networks}, BOOKTITLE = {Proceedings of the $36$th Annual Conference on Information

Sciences and Systems, CISS 2002},

YEAR = {2002}, ADDRESS = {Princeton, NJ}, MONTH = {March 20--22}}

@InProceedings{ChiangG97, AUTHOR = {Chiang, C.-C. and Gerla, M.}, TITLE = {Routing and Multicast in Mobile Wireless Networks}, BOOKTITLE = {Proceedings of 1997 IEEE 6th International Conference on

Universal Person Communications Record. Bridging the Way to the 21st Century, ICUPC'97},

ADDRESS = {San Diego, CA}, MONTH = {12--16 October}, VOLUME = 2, PAGES = {557--561}, YEAR = 1997}

@InProceedings{ChiangG98, AUTHOR = {Chiang, C.-C. and Gerla, M.}, TITLE = {On-Demand Multicast in Mobile Wireless Networks}, BOOKTITLE = {Proceedings of IEEE ICNP'98}, ADDRESS = {Austin, TX}, YEAR = 1998}

@InProceedings{ChiangGZ98, AUTHOR = {Chiang, C.-C. and Gerla, M. and Zhang, L.}, TITLE = {Adaptive Shared Tree Multicast in Mobile Wireless

Networks}, BOOKTITLE = {Proceedings of Globecom'98, IEEE Global Telecommunications

Conference}, ADDRESS = {Sydney, Australia}, MONTH = {November 8--12}, YEAR = 1998}

@InProceedings{ChiasseriniABG03, AUTHOR = {Chiasserini, C. F. and {Ajmone Marsan}, M. and Baralis, E.

and Garza, P.}, TITLE = {Towards Feasible Topology Formation Algorithms for

{B}luetooth-based {WPAN}s}, BOOKTITLE = {Proceedings of IEEE HICSS-36 2003}, ADDRESS = {Big Island, Hawaii}, MONTH = {January 6--9},

YEAR = 2003, NOTE = {personal communication}}

@InProceedings{ChiasseriniCMN02, AUTHOR = {Chiasserini, C. and Chlamtac, I. and Monti, P. and Nucci,

A.}, TITLE = {Energy-efficient design of wireless ad hoc networks}, BOOKTITLE = {Proceedings of IFIP Networking 2002}, ADDRESS = {Pisa, Italy}, YEAR = 2002}

@InProceedings{ChintaDGS04, AUTHOR = {Krishna Kant Chintalapudi and Amit Dhariwal and Ramesh

Govindan and Gaurav Sukhatme}, TITLE = {Ad-Hoc Localization Using Ranging And Sectoring}, BOOKTITLE = {IEEE INFOCOM '04: The Conference on Computer

Communications}, YEAR = {2004}, VOLUME = {1}, MONTH = {March}, PAGES = {2662-2672}}

@InProceedings{ChintalapudiDGS04, AUTHOR = {Chintalapudi, K. K. and Dhariwal, A. and Govindam, R. and

Sukhatme, G.}, TITLE = {Ad-Hoc Localization Using Ranging and Sectoring}, BOOKTITLE = {Proceedings of the $23$rd Annual Join Conference of the

IEEE Computer and Communications Societies, Infocom 2004}, PAGES = {2662--2672}, YEAR = {2004}, VOLUME = {4}, ADDRESS = {San Francisco, CA}, MONTH = {March 7--11}}

@Article{ChitreSS08, AUTHOR = {Chitre, M. and Shahabudeen, S. and Stojanovic, M.}, TITLE = {Underwater Acoustic Communications and Networking: Recent Advances and Future Challenges}, JOURNAL = {Marine Technology Society Journal}, VOLUME = 42, NUMBER = 1, PAGES = {103--116},

MONTH = {Spring}, YEAR = {2008}}

@InCollection{ChlamtacBR96, AUTHOR = {Chlamtac, I. and {Bing Lin}, Y. and Redi, J.}, TITLE = {Mobile Computing: When Mobility Meets Computation}, BOOKTITLE = {Encyclopedia of Microcomputers}, EDITOR = {James G. Williams}, PUBLISHER= {Marcel Dekker Publishers}, YEAR = 1996, NOTE = {in print}}

@Article{ChlamtacF94, AUTHOR = {Chlamtac, I. and Farag\'o, A.}, TITLE = {Making Transmission Schedules Immune to Topology Changes

in Multi-Hop Packet Radio Networks}, JOURNAL = {IEEE/ACM Transactions on Networking}, VOLUME = 2, NUMBER = 1, PAGES = {23--29}, YEAR = {February 1994}}

@Article{ChlamtacF99, AUTHOR = {Chlamtac, I. and Farag\'o, A.}, TITLE = {A New Approach to the Design and Analysis of Peer-to-Peer

Mobile Networks}, JOURNAL = {Wireless Networks}, VOLUME = 5, NUMBER = 3, PAGES = {149--156}, MONTH = {May}, YEAR = {1999}}

@Article{ChlamtacFA94, AUTHOR = {Chlamtac, I. and Farag\'o, A. and Ahn, H. Y.}, TITLE = {A topology transparent link attivation protocol for Mobile

{CDMA} Radio Networks}, JOURNAL = {IEEE Journal on Selected Areas in Communications}, VOLUME = 12, NUMBER = 8, PAGES = {1426--1433}, YEAR = {October 1994}

}

@Article{ChlamtacFZ96, AUTHOR = {Chlamtac, I. and Farag\ò, A. and Zhang, T.}, TITLE = {Lightpath (Wavelength) Routing in Large {WDM} Networks}, JOURNAL = {IEEE Journal on Selected Areas in Communications}, YEAR = {1996}, VOLUME = {14}, NUMBER = {5}, PAGES = {909--913}, MONTH = {June}}

@Article{ChlamtacFZ97, AUTHOR = {Chlamtac, I. and Farag\'o, A. and Zhang, H.}, TITLE = {Time-Spread Multiple-Access {(TSMA)} Protocols for

Multihop Mobile Radio Networks}, JOURNAL = {ACM/IEEE Transactions on Networking}, VOLUME = 5, NUMBER = 6, PAGES = {804--812}, YEAR = {December 1997}}

@InProceedings{ChlamtacK84, AUTHOR = {Chlamtac, I. and Kutten, S.}, TITLE = {An Efficient Broadcast Protocol Embedded in Multi-Hop

Radio Networks}, BOOKTITLE = {Proceedings of COMPCON}, ADDRESS = {Arlington, VA, USA}, PAGES = {220--229}, MONTH = {September 16--20}, YEAR = 1984, ABSTRACT = {Multi-hop radio networks is considered. The proposed

protocol is designed to provide an access method with high broadcast capacity and bounded delay while using only a small amount of network bandwidth and node memory in the broadcasting process. Thus, during an ongoing broadcast activity, the nodes can continue to use the channel for other non-broadcast-related transmissions using an existing data link multiaccess protocol. This results in a combination of 'deterministic' type of service for the broadest activity embedded in a multiaccess data link protocol designed for random demands. This integration of the differing services, concurrently using the same network resources, is comparable in concept to hybrid

circuit/packet switching. thus applications with different service criteria can be interleaved in the same radio network (28 Refs.)}

}

@Article{ChlamtacK85, AUTHOR = {Chlamtac, I. and Kutten, S.}, TITLE = {On Broadcasting in Radio Networks---Problem Analysis and

Protocol Design}, JOURNAL = IEEETC, VOLUME = {COM-33}, NUMBER = 12, PAGES = {1240--1246}, MONTH = {December}, YEAR = 1985, ABSTRACT = {A graph-oriented model for dealing with broadcasting in

radio networks is developed. Using this model, optimality in broadcasting protocols is defined, and it is shown that the problem of finding an optimal protocol is NP-hard. A polynomial time algorithm is proposed under which a channel is assigned to nodes on the basis of global, multiple-source broadcasting considerations. In particular, nodes participating in the broadcast do not interfere with each other's transmissions, but otherwise simultaneous channel reuse is permitted. Protocol implementations of this approach by frequency division and by time division are given. It is shown that, using these protocols, bounded delay for broadcast messages can be guaranteed (17 Refs.)}

}

@Article{ChlamtacK87, AUTHOR = {Chlamtac, I. and Kutten, S.}, TITLE = {Tree-Based Broadcasting in Multihop Radio Networks}, JOURNAL = {IEEE Transactions on Computers}, VOLUME = {C-36}, NUMBER = 10, PAGES = {1209--1223}, MONTH = {October}, YEAR = 1987, ABSTRACT = {To deliver a broadcast message to all network nodes

efficiently, a broadcasting protocol is proposed that utilizes two basic properties of the multihop radio network. One property used is the broadcast nature of the radio, which allows every single transmission to reach all nodes that are in line of sight and within range of the transmitting node. The other is spatial reuse of the radio

channel, which, due to the multihop nature of the network, allows multiple simultaneous transmissions to be received correctly. The proposed protocol incorporates these properties to obtain collision-free forwarding of the broadcasted message on a tree. Centralized and distributed algorithms for the tree construction are presented. The trees obtained are unique in incorporating radio-oriented time ordering as part of their definition. The proposed broadcast protocol possesses the advantages of TDM (time- division multiplexed) solutions while allowing the channel bandwidth to be shared, concurrently with the broadcast, with other transmission activities as dictated, for instance, by data link protocols. Some NP-completeness proofs are given (27 Refs.)}

}

@Article{ChlamtacL87, AUTHOR = {Chlamtac, I. and Lerner, A}, TITLE = {Fair Algorithms for Maximal Link Activation in Multihop

Radio Networks}, JOURNAL = {IEEE Transactions on Communications}, VOLUME = {COM-35}, NUMBER = 7, PAGES = {739--746}, YEAR = {July 1987}, ABSTRACT = {A distributed algorithm for obtaining a fair time-slot

allocation for link activation in a multihop radio network is presented. The concept of maximal fairness in which the termination of a fair allocation algorithm is related to maximal reuse of the channel under a given fairness metric is introduced. The fairness metric can be freely interpreted as the expected link traffic load demands, link priorities, etc. Since respective demands for time slot allocation will not necessarily be equal, the authors define fairness in terms of the closeness of allocation to respective link demands while preserving the collision free property. The algorithm can be used in conjunction with existing link activation algorithms to provide a fairer and fuller utilization of the channel (14 Refs.)}

}

@Article{ChlamtacP87, AUTHOR = {Chlamtac, I. and Pinter, S. S.}, TITLE = {Distributed Node Organization Algorithm for Channel Access

in a Multihop Dynamic Radio Network}, JOURNAL = {IEEE Transactions on Computers},

VOLUME = {C-36}, NUMBER = 6, PAGES = {728--737}, MONTH = {June}, YEAR = {1987}, ABSTRACT = {A solution to providing a collision-free channel

allocation in a multihop mobile radio network is proposed. An efficient solution to this problem provides spatial reuse of the bandwidth whenever possible. A robust solution maintains the collision-free property of the allocation under any combination of topological changes. The node-organization algorithm presented provides a completely distributed, maximally localized execution of collision-free channel allocation. It allows for parallel channel allocation in stationary and mobile networks with provable spatial reuse properties. A simpler version of the algorithm also provides a highly localized distributed coloring algorithm of dynamic graphs (27 Refs.)}

}

@InProceedings{ChlamtacW87, AUTHOR = {Chlamtac, I. and Weinstein, O.}, TITLE = {Distributed `Wave' Broadcasting in Mobile Multi-Hop Radio

Networks}, BOOKTITLE = {Proceedings of the $7$th International Conference on

Distributed Computing Systems}, PAGES = {82--89}, ADDRESS = {Berlin, Germany}, MONTH = {September 25--27}, YEAR = 1987}

@Article{ChlamtacW91, AUTHOR = {Chlamtac, I. and Weinstein, O.}, TITLE = {The Wave Expansion Approach to Broadcasting in Multihop

Radio Networks}, JOURNAL = IEEETC, VOLUME = 39, NUMBER = 9, PAGES = {426--433}, MONTH = {March}, YEAR = 1991}

@Article{Chvatal79, AUTHOR = {Chv\'atal, V.},

TITLE = {A Greedy Heuristic for the Set Covering Problem}, JOURNAL = {Mathematics of Operation Research}, YEAR = {1979}, VOLUME = {4}, NUMBER = {3}, PAGES = {233-235}}

@Article{CidonS89, AUTHOR = {Cidon, I. and Sidi, M.}, TITLE = {Distributed Assignment Algorithms for Multihop Packet

Radio Networks}, JOURNAL = {IEEE Transactions on Computers}, VOLUME = {38}, NUMBER = 10, PAGES = {1353--1361}, YEAR = {October 1989}, ABSTRACT = {New distributed dynamic channel assignment algorithms for

a multihop packet radio network are introduced. The algorithms ensure conflict-free transmissions by the nodes of the network. The basic idea of the algorithms is to split the shared channel into a control segment and a transmission segment. The control segment is used to avoid conflicts among nodes and to increase the utilization of the transmission segment. It is shown how these algorithms can be used in order to determine time-division multiple access (TDMA) cycles with spatial reuse of the channel (16 Refs.)}

}

@InProceedings{Clark96, AUTHOR = {Clark, Jr., B. A.}, TITLE = {{GPS} Military Land Navigation and Strategy Impacts}, BOOKTITLE = {Proceedings of Position, Location and Navigation

Symposium, PLANS 96}, PAGES = {381-384}, ADDRESS = {Atlanta, GA}, MONTH = {April}, YEAR = 1996, ABSTRACT = {The battlefield of the future is a highly dynamic and

lethal environment that will demand near real time situational awareness information. In order for Army commanders to survive and win in this environment, they must use a host of complex systems that provide reliable time synchronization and accurate information on the location of friendly and hostile forces. Under the ongoing

army digitization strategy, the Global Positioning System (GPS) will be used as the ``linchpin'' to accomplish this effort (6 Refs.)}

}

@Article{ClarkCJ90, AUTHOR = {Clark, B. N. and Colbourn, C. J. and Johnson, D. S.}, TITLE = {Unit Disk Graphs}, JOURNAL = {Discrete Mathematics}, VOLUME = 86, PAGES = {165--167}, YEAR = 1990}

@InProceedings{ClebusGGPR99, AUTHOR = {Chlebus, B. S. and G\c{a}sieniec, L. and Gibbons, A. and

Pelc, A. and Rytter, W.}, TITLE = {Deterministic Broadcasting in Unknown Radio Networks}, BOOKTITLE = {Proceedings of 11th Annual ACM-SIAM Symposium on Discrete

Algorithms (SODA'00)}, ADDRESS = {San Francisco, CA}, MONTH = {January}, YEAR = {2000}}

@InProceedings{ColbournSL03, AUTHOR = {Colbourn, C. J. and Syrotiuk, V. R. and Ling, A. C. H.}, TITLE = {Steiner Systems for Topology-Transparent Access Control in

{MANETs}}, BOOKTITLE = {Proceedings of the Second International Conference on Ad

Hoc Networks and Wireless, Ad Hoc Now 2003}, YEAR = {2003}, PUBLISHER= {Springer}, SERIES = {LNCS}, VOLUME = {2865}, ADDRESS = {Montreal, Quebec}, MONTH = {October 8--10}}

@InProceedings{ColeV86, AUTHOR = {Cole, R. and Vishkin, U.}, TITLE = {Deterministic Coin Tossing and Accelerating Cascades:

Micro and Macro Techniques for Designing Parallel Algorithms},

BOOKTITLE = {Proceedings of the $18$th Annual ACM Symposium on Theory

of Computing}, ADDRESS = {Berkeley, CA}, MONTH = {28-30 May}, YEAR = {1986}, PAGES = {206--219}}

@Article{CommACM41-7, AUTHOR = {Communications of the ACM}, TITLE = {Special {I}ssue on {D}igital {W}atermarking}, JOURNAL = {Communications of the ACM}, VOLUME = 41, NUMBER = 7, MONTH = {July}, YEAR = 1998}

@Book{CormenLRS01, AUTHOR = {Cormen, T. H. and Leiserson, C. E. and Rivest, R. L. and

Stein, C.}, TITLE = {Introduction to Algorithms}, EDITION = {Second}, PUBLISHER= {The MIT Press and McGraw-Hill Book Company}, ADDRESS = {Cambridge, MA and New York, NY}, YEAR = 2001}

@Article{CorsonB95, AUTHOR = {Corson, S. M. and Batsell, S. G.}, TITLE = {A Reservation-Based Multicast ({RBM}) Routing Protocol for

Mobile Networks: Initial Route Construction Phase}, JOURNAL = {Wireless Networks}, VOLUME = 1, NUMBER = 4, PAGES = {427--450}, YEAR = 1995, ABSTRACT = {We propose a combined multicast routing, resource

reservation and admission control protocol, termed reservation-based multicast (RBM), that borrows the ``rendezvous point'' or ``core'' concept from multicast routing algorithms proposed for the Internet, but which is intended for operation in mobile networks and routes hierarchically-encoded data streams based on user-specified fidelity requirements, real-time delivery thresholds and prevailing network bandwidth constraints. The protocol exhibits the fully distributed operation and

receiver-initiated orientation of these proposed algorithms; but, unlike them, the protocol is tightly coupled to a class of underlying, distributed, unicast routing protocols thereby facilitating operation in a dynamic topology. This paper focuses on the initial route construction phase, assumed to occur during a static ``snapshot'' of the dynamic topology, and is therefore applicable to fixed networks as well, e.g., the Internet. (39 References).}

}

@TechReport{CoudertDPRV06, AUTHOR = {Coudert, D. and Datta, P. and Pernnes, S. and Rivano, H.

and Voge, M.-E.}, TITLE = {Complexity and Approximability Issues of Shared Risk

Resource Group}, INSTITUTION = {INRIA}, YEAR = {2006}, NUMBER = {5859}, ADDRESS = {Sophia Antipolis, France}, MONTH = {March}}

@Article{Cruse77, AUTHOR = {Cruse, A. B.}, TITLE = {A Note on $1$-factors of Certain Regular Multigraphs}, JOURNAL = {Discrete Mathematics}, VOLUME = 18, PAGES = {213--216}, YEAR = 1977}

@InProceedings{CuomoM02, AUTHOR = {Cuomo, F. and Melodia, T.}, TITLE = {A General Methodology and Key Metrics for Scatternet

Formation in {B}luetooth}, BOOKTITLE = {Proceedings of IEEE Globecom 2002}, ADDRESS = {Taipei, Taiwan}, MONTH = {17--21 November}, YEAR = {2002}}

@Article{DaiW04a, AUTHOR = {Dai, F. and Wu, J.}, TITLE = {An Extended Localized Algorithms for Connected Dominating

Set Formation in Ad Hoc Wireless Networks},

JOURNAL = {IEEE Transactions on Parallel and Distributed Systems}, YEAR = {2004}, VOLUME = {15}, NUMBER = {10}, PAGES = {908--920}, MONTH = {October}}

@InProceedings{Dana98, AUTHOR = {Dana, P. H.}, TITLE = {Global Positioning System Overview}, BOOKTITLE = {http://www.utexas.edu/ depts/ grg/ gcraft/ notes/

gps/gps.html}, ADDRESS = {Department of Geography, University of Texas at Austin.}, YEAR = 1998}

@Book{Dana98a, AUTHOR = {Dana, P. H.}, TITLE = {The Geographer's Craft Project}, PUBLISHER= {Department of Geography, The Uni\-ver\-si\-ty of Texas at

Austin}, ADDRESS = {Austin, TX}, YEAR = 1998, NOTE = {http://www.utexas.edu/depts/grg/gcraft/notes/

gps/gps.html}}

@InProceedings{DasB97, AUTHOR = {Das, B. and Bharghavan, V.}, TITLE = {Routing in Ad-Hoc Networks Using Minimum Connected

Dominating Sets}, BOOKTITLE = {Proceedings of the IEEE International Conference on

Communications. ICC 1997}, PAGES = {376--380}, ADDRESS = {Montreal, Quebec, Canada}, MONTH = {June 8--12 }, YEAR = {1997}, ABSTRACT = {We impose a virtual backbone structure on the ad-hoc

network, in order to support unicast, multicast, and fault-tolerant routing within the ad-hoc network. This virtual backbone differs from the wired backbone of cellular networks in two key ways: (a) it may change as nodes move, and (b) it is not used primarily for routing packets or flows, but only for computing and updating routes. The primary routes for packets and flows are still

computed by a shortest-paths computation; the virtual backbone can, if necessary provide backup routes to handle interim failures. Because of the dynamic nature of the virtual backbone, our approach splits the routing problem into two levels: (a) find and update the virtual backbone, and (b) then find and update routes. The key contribution of this paper is to describe several alternatives for the first part of finding and updating the virtual backbone. To keep the virtual backbone as small as possible we use an approximation to the minimum connected dominating set (MCDS) of the ad-hoc network topology as the virtual backbone. The hosts in the MCDS maintain local copies of the global topology of the network, along with shortest paths between all pairs of nodes. (19 References).}

}

@InProceedings{DasguptaKK03, AUTHOR = {Dasgupta, K. and Kukreja, M. and Kalpakis, K.}, TITLE = {Topology-Aware Placement and Role Assignment for

Energy-Efficient Information Gathering in Sensor Networks}, BOOKTITLE = {Proceedings of the $8$th IEEE International Symposium on

Computers and Communications (ISCC 2003)}, PAGES = {341--348}, YEAR = {2003}, ADDRESS = {Kemer-Antalya, Turkey}, MONTH = {June 30--July 3}}

@InProceedings{DasguptaKN03, AUTHOR = {Dasgupta, K. and Kalpakis, K. and Namjoshi, P.}, TITLE = {An Efficient Clustering-Based Heuristic for Data Gathering

and Aggregation in Sensor Networks}, BOOKTITLE = {Proceedings of the IEEE Wireless Communications and


@InProceedings{DasPH05, AUTHOR = {Das, S. M. and Pucha, H. and Hu, Y. C.}, TITLE = {Performance Comparison of Scalable Location Services for

Geographic Ad Hoc Routing}, BOOKTITLE = {Proceeding of the $24$th IEEE Infocom 2005},

PAGES = {1228--1239}, VOLUME = 2, ADDRESS = {Miami, FL}, MONTH = {March 13--17}, YEAR = 2005}

@InProceedings{DattaS04, AUTHOR = {Datta, P. and Somani, A. K.}, TITLE = {Diverse Routing for Shared Risk Resource Groups ({SRRG})

Failures in {WDM} Optical Networks}, BOOKTITLE = {Proceedings of the First International Conference on

Broadband Networks, BroadNets 2004}, PAGES = {120--129}, YEAR = {2004}, ADDRESS = {San Jose, CA}, MONTH = {October 25--29}}

@MastersThesis{Davies00, AUTHOR = {Davies, V.}, TITLE = {Evaluating Mobility Models within an Ad Hoc Network}, SCHOOL = {Colorado School of Mines}, YEAR = {2000}, ADDRESS = {Golden, CO}}

@Book{Davis87, EDITOR = {Davis, L.}, TITLE = {Genetic Algorithms and Simulated Annealing}, SERIES = {Research Notes in Artificial Intelligence}, PUBLISHER= {Morgan Kauffman Publishers, Inc}, ADDRESS = {Los Altos, CA}, YEAR = 1987}

@Book{DeitelD08, AUTHOR = {Deitel, H. M. and Deitel, P. J.}, TITLE = {C++ How to Program}, EDITION = {Sixth}, PUBLISHER= {Prentice Hall}, ADDRESS = {Englewood Cliffs, NJ}, YEAR = 2008}

@Book{DeitelD97,

AUTHOR = {Deitel, H. M. and Deitel, P. J.}, TITLE = {C++ How to Program}, EDITION = {Second}, PUBLISHER= {Prentice Hall}, ADDRESS = {Englewood Cliffs, NJ}, YEAR = 1997}

@Book{DeitelDNM00, AUTHOR = {Deitel, H. M. and Deitel, P. J. and Nieto, T. R. and

McPhie, D. C.}, TITLE = {Perl How to Program}, PUBLISHER= {Prentice Hall}, ADDRESS = {Englewood Cliffs, NJ}, YEAR = 2000}

@Article{DemirkolEA06, AUTHOR = {Demirkol, I. and Ersoy, C. and Alag\"oz, F.}, TITLE = {{MAC} Protocols for Wireless Sensor Networks: A Survey}, JOURNAL = {IEEE Communications Magazine}, VOLUME = 44, NUMBER = 4, PAGES = {115--121}, MONTH = {April}, YEAR = 2006}

@InProceedings{Denko03, AUTHOR = {Denko, M. K.}, TITLE = {The Use of Mobile Agents for Clustering in Mobile Ad Hoc

Networks}, BOOKTITLE = {Proceedings of the 2003 Annual Research Conference of the

South African Institute of Computer Scientists and Information Technologists on Enablement through Technology, SAICSIT 03},

PAGES = {241--247}, YEAR = {2003}, ADDRESS = {Gauteng, South Africa}, MONTH = {September 17--19}}

@InProceedings{DolevLLN05, AUTHOR = {Dolev, S. and Lahiani, L. and Lynch, N. and Nolte, T.}, TITLE = {Self-stabilizing Mobile Node Location Management and

Message Routing},

BOOKTITLE = {Proceedings of the $7$th International Symposium on Self-stabilizing Systems, SSS 2005},

PAGES = {96--112}, YEAR = {2005}, SERIES = {LNCS 3764}, ADDRESS = {Barcelona, Spain}, MONTH = {October 26--27}}

@InProceedings{DravesPZ04, AUTHOR = {Draves, R. and Padhye, J. and Zill, B.}, TITLE = {Routing in Multi-Radio, Multi-Hop Wireless Networks}, BOOKTITLE = {Proceedings of the $10$th Annual International Conference

on Mobile Computing and Networking, ACM MobiCom 2004}, PAGES = {114--128}, YEAR = {2004}, ADDRESS = {Philadelphia, PA}, MONTH = {September 26--October 1}}

@Article{DubhashiHMPP06, AUTHOR = {Dubhashi, D. and H\"aggstr\"om, O. and Mambrini, G. and

Panconesi, A. and Petrioli, C.}, TITLE = {Blue Pleiades, A New Solution for Device Discovery and

Scatternet Formation in Multi-Hop {B}luetooth Networks}, JOURNAL = {ACM/Springer Wireless Networks}, YEAR = {2007}, VOLUME = {13}, NUMBER = {1}, PAGES = {107--125}, MONTH = {January}}

@Article{DubhashiHOPPV07, AUTHOR = {Dubhashi, D. and H\"aggstr\"om, O. and Orecchia, L. and

Panconesi, A. and Petrioli, C. and Vitaletti, A.}, TITLE = {Localized Techniques for Broadcasting in Wireless Sensor

Networks}, JOURNAL = {Algorithmica}, YEAR = {2007}, VOLUME = {49}, NUMBER = {4}, PAGES = {412--446}, MONTH = {}}

@InProceedings{DubhashiMPRS03, AUTHOR = {Dubhashi, D. and Mei, A. and Panconesi, A. and

Radhakrishnan, J. and Srinivasan, A.}, TITLE = {Fast Distributed Algorithms for (Weakly) Connected

Dominating Sets and Linear-Size Skeletons}, BOOKTITLE = {Proceedings of the $14$th Annual ACM-SIAM Symposium on

Discrete Algorithms (SODA)}, ADDRESS = {Baltimore, MD}, MONTH = {12--14 January}, YEAR = {2003}, PAGES = {717--724}}

@InProceedings{Duchamp92, AUTHOR = {Duchamp, D.}, TITLE = {Issues in Wireless Mobile Computing}, BOOKTITLE = {Proceedings of the $3$th IEEE Workshop on Workstation

Operating Systems}, ADDRESS = {Key Biscayne, FL}, MONTH = {23--24 April}, YEAR = {1992}, PAGES = {2--10}}

@TechReport{Duchamp93, AUTHOR = {Duchamp, D.}, TITLE = {Issues in Wireless Mobile Computing}, NUMBER = { }, YEAR = 1993, INSTITUTION = {Computer Science Department}, ADDRESS = {Columbia University}}

@InProceedings{DunbabinCVR06, AUTHOR = {Dunbabin, M. and Corke, P. and Vasilescu, I. and Rus, D.}, TITLE = {Data Muling over Underwater Wireless Sensor Networks using

an Autonomous Underwater Vehicle}, BOOKTITLE = {Proceedings of the 2006 IEEE International Conference on

Robotics and Automation, ICRA 2006}, ADDRESS = {Orlando, FL}, MONTH = {May 15--19}, YEAR = {2006}, PAGES = {2091--2098}}

@Book{Dziong97,

AUTHOR = {Dziong, Z.}, TITLE = {ATM Network Resource Management}, SERIES = {McGraw-Hill Series on Computer Communications}, PUBLISHER= {McGraw--Hill}, ADDRESS = {New York, NY}, YEAR = 1997}

@Article{EkiciGB06, AUTHOR = {Ekici, E. and Gu, Y. and Bozdag, D.}, TITLE = {Mobility-based Communications in Wireless Sensor

Networks}, JOURNAL = {IEEE Communications Magazine}, YEAR = {2006}, VOLUME = {44}, NUMBER = {7}, PAGES = {56--62}, MONTH = {July}}

@MastersThesis{Elia04, AUTHOR = {Elia, M.}, TITLE = {Virtual Backbone for Energy Saving ({ViBES}) in Wireless

Sensor Networks}, SCHOOL = {Northeastern University}, YEAR = {2004}, ADDRESS = {Boston, MA}, MONTH = {May}}

@Article{Ephremides83, AUTHOR = {Ephremides, A.}, TITLE = {Design Concepts for a Mobile-user Radio Network}, JOURNAL = {Computers \& Electrical Engineering}, VOLUME = 10, NUMBER = 3, PAGES = {127--135}, YEAR = 1983, ABSTRACT = {The totality, complexity, and interaction of security

issues along with other operational issues in the design of a mobile-user (generally multi-hop) radio network makes the task of designing such a system a formidable one. Without the benefit of sufficient theoretical support for globally modeling such a design problem, we are often forced to make hard choices based on qualitative and uncertain guidelines. This paper explores one example of such a design. The

example is general enough to be useful and specific enough to put to a test the capabilities of the different theories and approaches that have been proposed in connection with mobile radio network design. (5 References).}

}

@Article{EphremidesT90, AUTHOR = {Ephremides, A. and Truong, T. V.}, TITLE = {Scheduling Broadcasts in Multihop Radio Networks}, JOURNAL = {IEEE Transactions on Communications}, VOLUME = 38, NUMBER = 4, PAGES = {456--460}, MONTH = {April}, YEAR = 1990, ABSTRACT = {A comprehensive study of the problem of scheduling

broadcast transmissions in a multihop, mobile packet radio network is provided that is based on throughput optimization subject to freedom from interference. It is shown that the problem is NP complete. A centralized algorithm that runs in polynomial time and results in efficient (maximal) schedules is proposed. A distributed algorithm that achieves the same schedules is then proposed. The algorithm results in a maximal broadcasting zone in every slot (11 Refs.)}

}

@Article{EphremidesWB87, AUTHOR = {Ephremides, A. and Wieselthier, J. E. and Baker, D. J.}, TITLE = {A design concept for reliable mobile radio networks with

frequency hopping signaling}, JOURNAL = {Proceedings of the IEEE}, VOLUME = 75, NUMBER = 1, PAGES = {56--73}, MONTH = {January}, YEAR = 1987, ABSTRACT = {The authors outline the features that distinguish the

high- frequency Intra Task Force Network from other packet radio networks, and a design concept for this network is presented that encompasses organizational structure, waveform design, and channel access. Network survivability is achieved through the use of distributed networking control and frequency-hopping spread-spectrum signaling. The authors demonstrate how the execution of the fully distributed linked cluster algorithm enables the network to

reconfigure itself when it is affected by connectivity changes such as those resulting from jamming. Additional resistance against jamming is provided by frequency hopping, which leads naturally to the use of code-division multiple-access (CDMA) techniques that permit the simultaneous successful transmission by several users. Distributed algorithms that utilize CDMA properties have been developed to schedule contention-free transmissions for much of the channel access in this network. Contention-based channel access protocols can also be implemented (29 Refs.)}

}

@Article{Eppstein99, AUTHOR = {Eppstein, D.}, TITLE = {Finding the $k$ Shortest Paths}, JOURNAL = {SIAM Journal on Computing}, PUBLISHER= {Soc. Industrial {\&} Applied Mathematics}, VOLUME = 28, NUMBER = 2, PAGES = {652--673}, MONTH = {February}, YEAR = 1999}

@InProceedings{ErdosL75, AUTHOR = {{Erd\"{o}s}, P. and {Lov\'{a}sz, L.}}, TITLE = {Problem and Results on $3$-Cromatic Hypergraphs and some

Related Questions}, EDITOR = {Hajnal, A. and alt.}, BOOKTITLE = {Infinite and Finite Sets}, ADDRESS = {Amsterdam}, YEAR = 1975, PAGES = {609--627}}

@InProceedings{ErS04, AUTHOR = {Er, I. I. and Seah, W. K. G.}, TITLE = {Mobility-Based d-hop Clustering Algorithm for Mobile Ad

Hoc Networks}, BOOKTITLE = {Proceedings of IEEE Wireless Communications and Networking

Conference, WCNC 2004}, PAGES = {2359--2364}, VOLUME = {4}, YEAR = {2004},

ADDRESS = {Atlanta, GA}, MONTH = {March 21--25}}

@InProceedings{EstrinGHK99, AUTHOR = {Estrin, D. and Govindam, R. and Heidemann, J. and Kumar,

S.}, TITLE = {Next Century Challenges: Scalable Coordination in Sensor

Networks}, BOOKTITLE = {Proceedings of ACM MobiCom}, ADDRESS = {Seattle, WA}, YEAR = 1999}

@Book{Even79, AUTHOR = {Even, S.}, TITLE = {Graph Algorithms}, PUBLISHER= {Computer Science Press}, ADDRESS = {Rockville, MD}, SERIES = {Computer Software Engineering Series}, YEAR = 1979}

@InProceedings{Farago01a, AUTHOR = {Farag\'o, A.}, TITLE = {Quick Estimation of Blocking and Utilization for Complex

Traffic Flows}, BOOKTITLE = {Proceedings of the $9$th International Conference on

Telecommunication Systems Modeling and Analysis}, PAGES = {412--420}, YEAR = {2001}, ADDRESS = {Dallas, TX}, MONTH = {March 15--18}}

@InProceedings{Farago01b, AUTHOR = {Farag\'o, A.}, TITLE = {A General Method for the Blocking Analysis of Networks

with Dependent Links}, BOOKTITLE = {Proceedings of the IEEE Workshop on High Performance

Switching and Routing, HPSR 2001}, PAGES = {124--129}, YEAR = {2001}, ADDRESS = {Dallas, TX}, MONTH = {May 29--31}}

@InProceedings{Farago01c, AUTHOR = {Farag\'o, A.}, TITLE = {A Method to Handle Dependent Events in Network Performance

and Reliability Evaluation}, BOOKTITLE = {Proceedings of the $9$th IFIP Conference on Performance

Modeling and Evaluation of ATM and IP Networks}, PAGES = {299--305}, YEAR = {2001}, ADDRESS = {Budapest, Hungary}, MONTH = {June 27--29}}

@InProceedings{Farago02, AUTHOR = {Farag\'o, A.}, TITLE = {Network Level Capacity Planning with Efficiently

Computable Global Optimum}, BOOKTITLE = {Proceedings of the IEEE International Symposium on

Modeling, Analysis and Simulations of Computer and Telecommunication Systems, MASCOTS 2002},

PAGES = {229--236}, YEAR = {2002}, ADDRESS = {Forth Worth, TX}, MONTH = {October 11--16}}

@InProceedings{Farago02b, AUTHOR = {Farag\'o, A.}, TITLE = {Scalable Analysis and Design of Ad Hoc Networks Via Random

Graph Theory}, BOOKTITLE = {Proceedings of the $6$th ACM International Workshop on

Discrete Algorithms and Methods for Mobile Computing and Communications, Dial M for Mobility 2002},

PAGES = {43--50}, YEAR = {2002}, ADDRESS = {Atlanta, GA}, MONTH = {September 28}}

@InProceedings{Farago03, AUTHOR = {Farag\'o, A.}, TITLE = {Graph Theoretic Analysis of Ad Hoc Network Vulnerability}, BOOKTITLE = {Proceedings of the Workshop on Modeling and Optimization

in Mobile, Ad Hoc and Wireless Networks, WiOpt 2003},

PAGES = {171--180}, YEAR = {2003}, ADDRESS = {Sophia Antipolis, France}, MONTH = {March 3--5}}

@InProceedings{Farago03a, AUTHOR = {Farag\'o, A.}, TITLE = {Efficient Global Optimization of Physical and Logical

Capacity}, BOOKTITLE = {Proceedings of the $7$th IFIP Conference on Optical

Network Design and Modelling, ONDM 2003}, YEAR = {2003}, ADDRESS = {Budapest, Hungary}, MONTH = {February 3--5}}

@InProceedings{Farago03b, AUTHOR = {Farag\'o, A.}, TITLE = {A Unified Framework for Routing Metrics}, BOOKTITLE = {Proceedings of High Speed Networking 2003}, YEAR = {2003}, ADDRESS = {Budapest, Hungary}, MONTH = {May 21--22}}

@InProceedings{Farago03c, AUTHOR = {Farag\'o, A.}, TITLE = {A Mathematical Method for Analyzing the Effect of

Different Protocol Layers on Routing in Ad Hoc Networks}, BOOKTITLE = {Proceedings of the International Conference on Wireless

Networks}, YEAR = {2003}, ADDRESS = {Las Vegas, NV}, MONTH = {June 23--26}}

@InCollection{Farago04, AUTHOR = {Farag\'o, A.}, TITLE = {Algorithmic Challenges in Ad Hoc Networks}, BOOKTITLE = {Mobile Ad Hoc Networking}, PAGES = {427--445}, PUBLISHER= {IEEE Press and John Wiley \& Sons, Inc.}, YEAR = {2004}, EDITOR = {Basagni, S. and Conti, M. and Giordano, S. and

Stojmenovic, I.},

CHAPTER = {16}, ADDRESS = {Piscataway, NJ and Hoboken, NJ}, MONTH = {April}}

@Article{Farago07, AUTHOR = {Farag\'o, A.}, TITLE = {On the Fundamental Limits of Topology Control in Ad Hoc

Networks}, JOURNAL = {Algorithmica}, YEAR = {2007}, VOLUME = {49}, NUMBER = {4}, PAGES = {337--356}, MONTH = {December}}

@Misc{FaragoS, AUTHOR = {Farag\'o, A. and Syrotiuk, V. R.}, TITLE = {Method and Device for Communicating Data Within a Network

by Combining Different Communication Approaches}, HOWPUBLISHED = {Pending patent}}

@Article{FaragoS03, AUTHOR = {Farag\'o, A. and Syrotiuk, V. R.}, TITLE = {{MERIT}: A Scalable Approach for Protocol Assessment}, JOURNAL = {Mobile Networks and Applications (MONET)}, YEAR = {2003}, VOLUME = {8}, NUMBER = {5}, PAGES = {567--577}, MONTH = {October}}

@InCollection{FaragoS03a, AUTHOR = {Farag\'o, A. and Syrotiuk, V. R.}, TITLE = {Medium Access Control (MAC) Protocols}, BOOKTITLE = {Encyclopedia on Telecommunications}, PUBLISHER= {John Wiley \& Sons, Inc.}, YEAR = {2003}, EDITOR = {Proakis, J.}, ADDRESS = {Hoboken, NJ}}

@Article{FaragoSS03,

AUTHOR = {Farag\'o, A. and Szentesi, A. and Szviatovszki, B.}, TITLE = {Inverse Optimization in High Speed Networks}, JOURNAL = {Discrete Applied Mathematics}, YEAR = {2003}, VOLUME = {129}, NUMBER = {1}, PAGES = {83--98}, MONTH = {June}}

@TechReport{FaragoUF02, AUTHOR = {Farag\'o, A. and Unghvary, F. and Fumagalli, A.}, TITLE = {Towards the Unified Engineering of Traffic and

Reliability}, INSTITUTION = {The University of Texas at Dallas}, YEAR = {2002}, ADDRESS = {Richardson, TX}, MONTH = {December}}

@InProceedings{FaragoUF03, AUTHOR = {Farag\'o, A. and Unghvary, F. and Fumagalli, A.}, TITLE = {On Incorporating Dependent Link Failures in a Traffic

Engineering Model}, BOOKTITLE = {Proceedings of the IEEE ICC 2003}, YEAR = {2003}, ADDRESS = {Anchorage, AK}, MONTH = {May 11--15}}

@Article{FarberGV98, AUTHOR = {F{\"{a}}rber, N. and Girod, B. and Villasenor, J.}, TITLE = {Extension if {ITU-T} Recommendation {H}.234 for

Error-Resilient Video Transmissions}, JOURNAL = {IEEE Communications Magazine}, VOLUME = 36, NUMBER = 6, PAGES = {120--128}, MONTH = {June}, YEAR = 1998, ABSTRACT = {The authors provide an overview of techniques that enable

the use of ITU-T recommendation H.324 with error-prone transmission channels. H.324 covers the overall architecture, algorithms, and syntax for low-bit-rate multimedia terminals. This overview focuses on extensions for error-resilient video transmission that are related to

the H.263 video codec and H.223 multiplex. The latter is responsible for reliable delivery of data to each terminal component and is therefore of major importance to the overall system. In particular, the discussed approaches to robust video transmission require reliable performance of the multiplex scheme. The considered techniques for video coding are either compatible with the baseline mode of H.263 or part of new extensions recently devised by Study Group 16 as part of the H.263+ effort. This overview includes `èrror tracking'' (Appendix II). ``reference picture selection'' (Annex N), and `ìndependent segment decoding'' (Annex R). Whenever appropriate, the description of those video extensions and multiplex schemes is complemented with simulation results for transmission over Rayleigh fading channels. (14 References).}

}

@InProceedings{FernandessM02, AUTHOR = {Fernandess, Y. and Malkhi, D}, TITLE = {$K$-Clustering in Wireless Ad Hoc Networks}, BOOKTITLE = {Proceedings of the Second ACM International Workshop on

Principles of Mobile Computing, POMC 2002}, PAGES = {31--37}, YEAR = {2002}, ADDRESS = {Toulouse, France}, MONTH = {October 30--31}}

@InProceedings{FerragutoMPP04, AUTHOR = {Ferraguto, F. and Mambrini, G. and Panconesi, A. and

Petrioli, C.}, TITLE = {A New Approach to Device Discovery and Scatternet

Formation in {B}luetooth Networks}, BOOKTITLE = {Proceedings of the $18$th IEEE International Parallel and

Distributed Processing Symposium, IPDPS 2004}, PAGES = {221--228}, YEAR = {2004}, ADDRESS = {Santa Fe, NM}, MONTH = {April 26--30}}

@InProceedings{FerraraGMLP05, AUTHOR = {Ferrara, D. and Galluccio, L. and Morabito, G. and Leonardi, A. and Palazzo, S.}, TITLE = {{MACRO}: An Integrated {MAC}/Routing Protocol for Geographical Forwarding in Wireless Sensor Network},

BOOKTITLE = {Proceedings of the $24$th IEEE Annual Conference on Computer Communications, INFOCOM 2005},

YEAR = {2005}, ADDRESS = {Miami, FL}, MONTH = {March 13--17}}

@InProceedings{FluryW06, AUTHOR = {Flury, R. and Wattenhofer, R.}, TITLE = {{MLS}: An Efficient Location Service for Mobile Ad Hoc

Networks}, BOOKTITLE = {Proceedings of the $7$th ACM International Symposium on

Mobile Ad Hoc Networking and Computing, MobiHoc 2006}, YEAR = {2006}, ISBN = {1-59593-368-9}, PAGES = {226--237}, DOI = {http://doi.acm.org/10.1145/1132905.1132931}, ADDRESS = {Florence, Italy}, MONTH = {May 22--25}}

@MastersThesis{Fokine02, AUTHOR = {Fokine, K.}, TITLE = {Key Management in Ad Hoc Networks}, SCHOOL = {Link\"opings University}, YEAR = {2002}, ADDRESS = {Link\"oping, Sweden}, MONTH = {September}}

@Article{FormanZ94, AUTHOR = {Forman, G. H. and Zahorjan, J.}, TITLE = {The Challenges of Mobile Computing}, JOURNAL = {Computer}, VOLUME = 27, NUMBER = 4, PAGES = {38--47}, MONTH = {April}, YEAR = 1994, ABSTRACT = {The technical challenges that mobile computing must

surmount to achieve its potential are hardly trivial. Some of the challenges in designing software for mobile computing systems are quite different from those involved in the design of software for today's stationary networked systems. The authors focus on the issues pertinent to software designers without delving into the lower level

details of the hardware realization of mobile computers. They look at some promising approaches under investigation and also consider their limitations. The many issues to be dealt with stem from three essential properties of mobile computing: communication, mobility, and portability. Of course, special- purpose systems may avoid some design pressures by doing without certain desirable properties. For instance portability would be less of a concern for mobile computers installed in the dashboards of cars than with hand-held mobile computers. However, the authors concentrate on the goal of large-scale, hand-held mobile computing as a way to reveal a wide assortment of issues (12 Refs.)}

}

@Book{FourerGK03, AUTHOR = {Fourer, R. and Gay, D. M. and Kernighan, B. W.}, TITLE = {{AMPL}: A Modeling Language for Mathematical Programming}, PUBLISHER= {Thomson-Brooks/Cole}, YEAR = {2003}, ADDRESS = {Pacific Grove, CA}, EDITION = {second}}

@InCollection{Frankl95, AUTHOR = {Frankl, P.}, TITLE = {Extremal Set Systems}, BOOKTITLE = {Handbook of Combinatorics}, VOLUME = {II}, EDITOR = {Graham, R. and Grotschel, M. and Lov\'{a}sz, L.}, PUBLISHER= {Elsevier: MIT Press}, PAGES = {1293--1329}, YEAR = 1995}

@InCollection{FreyS05, AUTHOR = {Frey, H. and Stojmenovic, I.}, TITLE = {Geographic and Energy-aware Routing in Sensor Networks}, BOOKTITLE = {Handbook of Sensor Networks: Algorithms and

Architectures}, EDITOR = {Stojmenovic, I.}, PUBLISHER= {John Wiley \& Sons, Inc.}, ADDRESS = {Hoboken, NJ}, PAGES = {381--415}, YEAR = 2005

}

@InProceedings{FreyS06, AUTHOR = {Frey, H. and Stojmenovic, I.}, TITLE = {On Delivery Guarantees of Face and Combined Greedy-Face

Routing Algorithms in Ad Hoc and Sensor Networks}, BOOKTITLE = {Proceedings of the $12$th ACM Annual International


ADDRESS = {Los Angeles, CA}, YEAR = 2006, PAGES = {390--401}, MONTH = {September 23--29}}

@TechReport{FriedmanK06, AUTHOR = {Friedman, R. and Kliot, G.}, TITLE = {Location Services in Wireless Ad Hoc and Hybrid Networks:

A Survey}, INSTITUTION = {Department of Computer Science, Technion}, YEAR = {2006}, NUMBER = {CS-2006-10}, ADDRESS = {Haifa, Israel}, MONTH = {April 24}}

@Article{FriesenHW96, AUTHOR = {Friesen, V. J. and Harms, J. J. and Wong, J. W.}, TITLE = {Resource Management with Virtual Paths in {ATM} Networks}, JOURNAL = {IEEE Network}, VOLUME = 10, NUMBER = 5, PAGES = {10--20}, MONTH = {September--October}, YEAR = {1996}, ABSTRACT = { A virtual path connection (VPC) is a labelled path which

can be used to transport a bundle of virtual channel connections (VCCs) and to manage the resources used by these connections. The virtual network is organized as a collection of VPCs which form a VPC, or logical, overlay network. If the VPCs are permanent or semi-permanent and have reserved capacity, establishing new VCCs requires simple connection admission decisions at the VPC terminators of existing VPCs. This would enable faster connection establishment since transit nodes are not

involved in the connection setup. The virtual path concept also allows the possibility of segregating traffic types according to quality of service requirements. However, the extent to which VPC provisioning is able to improve network efficiency is dependent on the resource management decisions that determine the VPC topology and capacity allocations. The article surveys resource management using virtual paths in an ATM network. Of interest are techniques which modify the VPC topology and capacity assignments in order to adapt to changing traffic conditions and possible network failures. The resource management activities employed to facilitate such adaptation can be categorized by the timescale on which they operate. On the shortest timescale are strategies for dynamically making minor changes to the VPC topology or capacity assignments. On a somewhat longer timescale are strategies for making more widespread modifications to the VPC overlay network. This would be appropriate for traffic changes based on time of day and for recovering from network failures. Finally, on an even longer timescale, strategies may be employed to design a general VPC overlay network, to be used at startup or after major network upgrades. Solutions to VPC resource management for each of these timescales are discussed. (76 References).}

}

@InProceedings{FumagalliT01a, AUTHOR = {Fumagalli, A. and Tacca, M.}, TITLE = {Optimal Design of Optical Ring Networks with

Differentiated Reliability ({DiR})}, BOOKTITLE = {Proceedings of the International Workshop on QoS in

Multiservice IP Networks, QoSIP 2001}, PAGES = {299--314}, YEAR = {2001}, ADDRESS = {Roma, Italy}, MONTH = {Aprile 24--26}}

@InProceedings{FumagalliT01b, AUTHOR = {Fumagalli, A. and Tacca, M.}, TITLE = {Differentiated Reliability ({DiR}) in Optical Networks}, BOOKTITLE = {Proceedings of the IEEE Gigabit Networking Workshop, GBN

2001}, YEAR = {2001}, ADDRESS = {Anchorage, AK}, MONTH = {April 22}

}

@InProceedings{FumagalliT01c, AUTHOR = {Fumagalli, A. and Tacca, M.}, TITLE = {Differentiated Reliability ({DiR}) in {WDM} Ring without

Wavelength Converters}, BOOKTITLE = {Proceedings of IEEE ICC 2001}, PAGES = {2887--2891}, VOLUME = {9}, YEAR = {2001}, ADDRESS = {Helsinki, Finland}, MONTH = {June 11--14}}

@InProceedings{FumagalliV01, AUTHOR = {Fumagalli, A. and Valcarenghi, L.}, TITLE = {The Preplanned Weighted Restoration Scheme}, BOOKTITLE = {Proceedings of the IEEE Workshop on High Performance

Switching and Routing, HPSR 2001}, PAGES = {36--41}, YEAR = {2001}, ADDRESS = {Dallas, TX}, MONTH = {May 29--31}}

@InProceedings{GaberM95, AUTHOR = {Gaber, I. and Mansour, Y.}, TITLE = {Broadcast in Radio Networks}, BOOKTITLE = {Proceedings of the $6$th Annual ACM-SIAM Symposium on

Discrete Algorithms}, ADDRESS = {San Francisco, CA}, MONTH = {22--24 January}, PAGES = {577--585}, YEAR = 1995}

@PhDThesis{Gabow73, AUTHOR = {Gabow, H. N.}, TITLE = {Implementation of Algorithms for Maximum Matching on

Non-bipartite Graphs}, SCHOOL = {Stanford University, Department of Computer Science}, YEAR = 1973, ADDRESS = {Palo Alto, CA}}

@Article{GabowT91,

AUTHOR = {Gabow, H. N. and Tarjan, R. E.}, TITLE = {Faster Scaling Algorithms for Generating Graph-Matching

Problems}, JOURNAL = JACM, VOLUME = 38, NUMBER = 4, PAGES = {815--853}, MONTH = {October}, YEAR = 1991}

@Misc{Gaffin02, AUTHOR = {Gaffin, A.}, TITLE = {Use an Open Wireless Port; Go to Jail?}, HOWPUBLISHED = {http://www.networkworld.com/compendium/archive/

001072.html}, MONTH = {August 14}, YEAR = {2002}}

@Article{Gallager85, AUTHOR = {Gallager, R.}, TITLE = {A Perspective on Multiaccess Channels}, JOURNAL = {IEEE Transactions on Information Theory. Special issue on

random access communications}, VOLUME = {{\bf IT-31}}, PAGES = {124--142}, YEAR = 1985}

@Article{GallagerHS83, AUTHOR = {Gallager, R. and Humblet, P. A. and Spira, P. M.}, TITLE = {A Distributed Algorithm for Minimum-Weight Spanning

Trees}, JOURNAL = ACMTPLS, VOLUME = 5, NUMBER = 1, PAGES = {66--77}, YEAR = 1983, ABSTRACT = {A distributed algorithm is presented that constructs the

minimum-weight spanning tree in a connected undirected graph with distinct edge weights. A processor exists at each node of the graph, knowing initially only the weights of the adjacent edges. The processors obey the same algorithm and exchange messages with neighbors until the tree is constructed. The total number of messages required

for a graph of N nodes and E edges is at most 5N log/sub 2/N+2E, and a message contains at most one edge weight plus log/sub 2/8N bits. The algorithm can be initiated spontaneously at any node or at any subset of nodes (9 Refs.)}

}

@InProceedings{GandhamDPV03, AUTHOR = {Gandham, S. R. and Dawande, M. and Prakash, R. and

Venkatesan, S.}, TITLE = {Energy Efficient Schemes for Wireless Sensor Networks with

Multiple Mobile Base Stations}, BOOKTITLE = {Proceedings of IEEE Globecom 2003}, PAGES = {377--381}, YEAR = {2003}, VOLUME = {1}, ADDRESS = {San Francisco, CA}, MONTH = {December 1--5}}

@InProceedings{GarciaLAM99, AUTHOR = {{Garcia-Luna-Aceves}, J. J. and Madruga, E. L.}, TITLE = {A Multicast Routing Protocol for Ad Hoc Networks}, BOOKTITLE = {Proceedings of IEEE INFOCOM'99}, VOLUME = 2, PAGES = {784--792}, ADDRESS = {New York City, NY}, MONTH = {22--25 March}, YEAR = 1999}

@Article{GarciaLAM99b, AUTHOR = {{Garcia-Luna-Aceves}, J. J. and Madruga, E. L.}, TITLE = {The Core-Assisted Mesh Protocol}, JOURNAL = {IEEE Journal on Selected Areas In Communications, Special

Issue on Wireless Ad Hoc Networks}, EDITORS = {Haas, Z. J. and Gerla, M. and Johnson, D. B. and Perkins,

C. E. and Pursley, M. B. and Steenstrup, M. and Toh, C.-K.},

VOLUME = 17, NUMBER = 8, PAGES = {1380--1394}, MONTH = {August}, YEAR = 1999}

@Article{GarciaNocettiSS03, AUTHOR = {{Garcia Nocetti}, F. and {Solano Gonzales}, J. and

Stojmenovic, I.}, TITLE = {Connectivity Based $k$-Hop Clustering in Wireless

Networks}, JOURNAL = {Telecommunication Systems}, YEAR = {2003}, VOLUME = {22}, NUMBER = {1--4}, PAGES = {205--220}, MONTH = {}}

@InProceedings{GarciaS85, AUTHOR = {{Garcia-Luna-Aceves}, J. J. and Sacham, N.}, TITLE = {Analysis of Routing Strategies for Packet Radio Networks}, BOOKTITLE = {Proceedings of IEEE INFOCOM'85}, ADDRESS = {Washington, DC}, PAGES = {292--302}, MONTH = {26--28 March}, YEAR = 1985, ABSTRACT = {The authors present a comparative analysis of network

routing schemes for large-scale packet radio networks (PRNET) with mobile nodes. This analysis is aimed at determining two things: (1) the time required to obtain consistent routing tables in all the nodes of a PRNET after topical changes, and (2) the optimality of the routing decisions made by a node in terms of the length of the paths chosen to remote destinations. Upper bounds are obtained on the length of shortest paths and on the time required for routing-table updating after topological changes in PRNETs with hierarchical organizations. Such bounds are used in the optimization of network topology and as guidelines for the design of hierarchical routing schemes for large PRNETs (16 Refs.)}

}

@Book{GareyJ79, AUTHOR = {Garey, M. R. and Johnson, D. S.}, TITLE = {Computers and Intractability: A Guide to the Theory of

NP-Completeness}, PUBLISHER= {Freeman}, ADDRESS = {San Francisco, CA}, YEAR = 1979}

@Article{GatzianasG08, AUTHOR = {Gatzianas, M. and Georgiadis, L.}, TITLE = {A Distributed Algorithm for Maximum Lifetime Routing in

Sensor Networks with Mobile Sink}, JOURNAL = {IEEE Transactions on Wireless Communications}, YEAR = {2008}, VOLUME = {7}, NUMBER = {3}, PAGES = {984--994}, MONTH = {March}}

@Misc{Geier06, AUTHOR = {Geier, E.}, TITLE = {A War Driving Experience--Part I: The Results}, HOWPUBLISHED = {http://www.wi-fiplanet.com/tutorials/article.php/3581946}, MONTH = {January}, YEAR = {2006}}

@InProceedings{GerlaL95, AUTHOR = {Gerla, M. and Lin, C. R.}, TITLE = {Multimedia transport in multihop dynamic packet radio

networks}, BOOKTITLE = {Proceedings of International Conference on Network

Protocols}, PAGES = {209--216}, ADDRESS = {Tokyo, Japan}, MONTH = {7--10 November}, YEAR = 1995, ABSTRACT = {The paper presents a distributed architecture which relies

on code division access scheme for multimedia transport in a wireless mobile radio network without a fixed infrastructure. The proposed multicluster architecture has the capability of rapid deployment and dynamic reconfiguration. Without the need of base stations, this architecture can operate in areas without a wired back-bone infrastructure. The presented architecture has two main advantages. First, this architecture can provide spatial reuse of the bandwidth due to node clustering. Second, computer simulation reveals that our cluster structure is robust in the face of topological changes due to node motion, node failure, and/or new node addition. In all, this architecture provides a stable infrastructure for the integration of different types of traffic in a dynamic radio network (10 Refs.)}

}

@Article{GerlaL97, AUTHOR = {Lin, C. R. and Gerla, M.}, TITLE = {Adaptive Clustering for Mobile Wireless Networks}, JOURNAL = JSAC, VOLUME = 15, NUMBER = 7, PAGES = {1265--1275}, MONTH = {September}, YEAR = 1997, NOTE = {This is here for back compatibility issues ;-)}}

@Article{GerlaT95, AUTHOR = {Gerla, M. and Tsai, J. T-C.}, TITLE = {Multicluster, mobile, multimedia radio network}, JOURNAL = WN, VOLUME = 1, NUMBER = 3, PAGES = {255--265}, YEAR = 1995, ABSTRACT = {A multi-cluster, multi-hop packet radio network

architecture for wireless adaptive mobile information systems is presented. The proposed network supports multimedia traffic and relies on both time division and code division access schemes. This radio network is not supported by a wired infrastructure as conventional cellular systems are. Thus, it can be instantly deployed in areas with no infrastructure at all. By using a distributed clustering algorithm, nodes are organized into clusters. The clusterheads act as local coordinators to resolve channel scheduling, perform power measurement/control, maintain time division frame synchronization, and enhance the spatial reuse of time slots and codes. Moreover, to guarantee bandwidth for real time traffic, the architecture supports virtual circuits and allocates bandwidth to circuits at call setup time. The network is scalable to large numbers of nodes, and can handle mobility. Simulation experiments evaluate the performance of the proposed scheme in static and mobile environments (17 Refs.)}

}

@Article{GerlaX03, AUTHOR = {Gerla, M. and Xu, K.}, TITLE = {Multimedia Streaming in Large-Scale Sensor Networks with

Mobile Swarms}, JOURNAL = {ACM SIGMOD Record}, YEAR = {2003}, VOLUME = {32}, NUMBER = {4}, PAGES = {72--76}, MONTH = {December}}

@InCollection{GiordanoS04, AUTHOR = {Giordano, S. and Stojmenovic, I.}, TITLE = {Position-based Routing Algorithms for Ad Hoc Networks: A

Taxonomy}, BOOKTITLE = {Ad Hoc Wireless Networking}, SERIES = {Network Theory and Applications}, PAGES = {103--136}, PUBLISHER= {Springer}, YEAR = {2004}, EDITOR = {Cheng, X and Huang, X. and Du, D.-Z.}, CHAPTER = {4}, ADDRESS = {New York, NY}}

@Unpublished{GiordanoSB02, AUTHOR = {Giordano, S. and Stojmenovic, I. and Blazevic, L.}, TITLE = {Position Based Routing Algorithms for Ad Hoc Networks: A

Taxonomy}, NOTE = {http://www.site.uottawa.ca/~ivan/wireless.html}, YEAR = {2002}}

@Proceedings{Glomo99, KEY = { }, TITLE = {DARPA/ITO Global Mobile Information Systems Principal

Investigators Meeting}, BOOKTITLE = {DARPA/ITO Global Mobile Information Systems Principal

Investigators Meeting}, MONTH = {February, 3--5}, ADDRESS = {Richardson, TX}, YEAR = 1999}

@Article{GoldbergP87, AUTHOR = {Goldberg, A. V. and Plotkin, S. A.}, TITLE = {Parallel {$(\Delta+1)$}-Coloring of Constant-Degree

Graphs},

JOURNAL = IPL, VOLUME = 25, NUMBER = 4, PAGES = {241--245}, MONTH = {17 June}, YEAR = 1987, ABSTRACT = {This paper presents parallel algorithms for coloring a

constant-degree graph with a maximum degree of Delta using Delta +1 colors and for finding a maximal independent set in a constant-degree graph. Given a graph with n vertices, the algorithms run in O(lg* n) time on an EREW PRAM with O(n) processors. The algorithms use only local communication and achieve the same complexity bounds when implemented in a distributed model of parallel computation (8 Refs.)}

}

@InProceedings{GoldbergPS87, AUTHOR = {Goldberg, A. V. and Plotkin, S. A. and Shannon, G. E.}, TITLE = {Parallel Symmetry-Breaking in Sparse Graphs}, BOOKTITLE = {Proceedings of the $19$th Annual ACM Symposium on Theory

of Computing}, ADDRESS = {New York City, NY}, MONTH = {May 25-27}, YEAR = 1987, PAGES = {315--324}}

@InProceedings{GoldbergS84, AUTHOR = {Goldberg, Z. and Sacham, N.}, TITLE = {A Distributed Network Protocol with Limited Span}, BOOKTITLE = {Proceedings of IEEE INFOCOM '84}, ADDRESS = {San Francisco, CA}, PAGES = {129--135}, MONTH = {9--12 April}, YEAR = 1984, ABSTRACT = {A distributed probing protocol that spans over limited

portions of a computer communication network is presented. Existing distributed network-control protocols necessitate involving the entire node population of a network in the protocol execution, even if the protocol's messages are relevant only within a small subset of network nodes. The protocol proposed possesses a termination property that enables it to span over a limited group of nodes, defined by hop-distance from the initiating node, which makes it applicable for use in large networks. A node that initiates

the protocol performs successive update cycles until the desired span is reached, an event that is recognized by the initiating node without the use of time-out. A spanning tree structure of nodes and hop-count for individual control messages, maintained by the protocol for propagating, control information; this information is used to indicate protocol completion to the initiating node. A basic version which assumes changing network conditions under fixed topology and which is based on a distributed control mechanism introduced by P.M. Merlin and A. Segall (1979) is presented (8 Refs.)}

}

@InProceedings{GoldenbergLMRY04, AUTHOR = {Goldenberg, D. K. and Lin, J. and Morse, A. S. and Rosen,

B. E. and Yang, Y. R.}, TITLE = {Towards Mobility as a Network Control Primitive}, BOOKTITLE = {Proceedings of the $5$th ACM International Symposium on

Mobile Ad Hoc Networking and Computing, MobiHoc 2004}, PAGES = {163--174}, YEAR = {2004}, ADDRESS = {Roppongi Hills, Tokyo, Japan}, MONTH = {May 24--26}}

@Book{GonickS93, AUTHOR = {Gonick, L. and Smith, W.}, TITLE = {The Cartoon Guide to Statistics}, PUBLISHER= {HarperPerennial}, YEAR = 1993}

@Article{GowaikarHH06, AUTHOR = {Gowaikar, R. and Hochwald, B. and Hassibi, B.}, TITLE = {Communication over a Wireless Network with Random

Connections}, JOURNAL = {IEEE Transactions on Information Theory}, PAGES = {2857--2871}, YEAR = {2006}, VOLUME = {52}, NUMBER = {7}, MONTH = {July}}

@Book{GPS94, EDITOR = {{Navtech Seminars \& Navtech Book and Software Store}},

TITLE = {GPS Navstar Global Positioning System}, EDITION = {5th}, PUBLISHER= {The Corporation}, ADDRESS = {Los Angeles, CA}, YEAR = {1994}}

@Book{GrahamKP94, AUTHOR = {Graham, R. L. and Knuth, D. E. and Patashnik, O.}, TITLE = {Concrete Mathematics}, PUBLISHER= AW, EDITION = {second}, YEAR = 1994}

@InProceedings{GreenbergL83, AUTHOR = {Greenberg, A. G. and Ladner, R. E.}, TITLE = {Extimating the Multiplicity of Conflicts in multi-access

channels}, BOOKTITLE = {Proceedings of the $24$th Annual Symposium on Foundations

of Computer Science}, ADDRESS = {Tucson, AZ}, MONTH = {7-9 November}, YEAR = 1983, PAGES = {383--392}}

@Article{GreenbergW85, AUTHOR = {Greenberg, A. G. and Winograd, S.}, TITLE = {A Lower Bound on the Time needed in Worst Case to Resolve

Conflicts Deterministically in Multiple Access Channels}, JOURNAL = JACM, VOLUME = 32, NUMBER = 3, PAGES = {589--596}, MONTH = {July}, YEAR = 1985, ABSTRACT = {A problem related to the decentralised control of a

multiple access channel is considered. Suppose k stations from an ensemble of n simultaneously transmit to a multiple access channel which provides the feedback 0, 1 or 2+, denoting k=0, k=1 or k>or=2, respectively. If k=1, then the transmission succeeds. If k>or=2, as a result of the conflict none of the transmissions succeed. An algorithm to resolve a conflict determines how to schedule retransmissions so that each of the conflicting stations

eventually transmits singly to the channel. In this paper, a general model of deterministic algorithms to resolve conflicts is introduced, and it is established that, for all k and n (2 ...}

}

@Book{GrewalWA01, AUTHOR = {Grewal, M. S. and Weill, L. R. and Andrews, A. P.}, TITLE = {Global Positioning Systems, Inertial Navigation, and

Integration}, PUBLISHER= {John Wiley \& Sons, Inc.}, YEAR = {2001}, ADDRESS = {Hoboken, NJ}}

@Book{Grimmett99, AUTHOR = {Grimmett, G.}, TITLE = {Percolation}, EDITION = {second}, SERIES = {Grundlehren der Mathematischen Wissenschaften}, VOLUME = {321}, PUBLISHER= {Springer}, ADDRESS = {New York, NY}, MONTH = {July 1}, YEAR = {1999}}

@Article{GrossglauserT02, AUTHOR = {Grossglauser, M. and Tse, D. N. C.}, TITLE = {Mobility Increases the Capacity of Ad-hoc Wireless

Networks}, JOURNAL = {IEEE/ACM Transactions on Networking}, PAGES = {477--486}, YEAR = {2002}, VOLUME = {10}, NUMBER = {4}, MONTH = {August}}

@Article{GuBBE06, AUTHOR = {Gu, Y. and Bozdag, D. and Brewer, R. W. and Ekici, E.}, TITLE = {Data Harvesting with Mobile Elements in Wireless Sensor

Networks}, JOURNAL = {Computer Networks}, PAGES = {3449--3465}, YEAR = {2006},

VOLUME = {50}, NUMBER = {17}, MONTH = {December}}

@InProceedings{GuerinKS02, AUTHOR = {Guerin, R. and Kim, E. and Sarkar, S.}, TITLE = {{B}luetooth Technology: Key Challenges and Initial

Research}, BOOKTITLE = {Proceedings of the SCS Conference on Networks and

Distributed Systems, CNDS 2002}, ADDRESS = {San Antonio, TX}, YEAR = {2002}, MONTH = {January 27--31}}

@InProceedings{GuerinSV02man, AUTHOR = {Guerin, R. and Sarkar, S. and Vergetis, E.}, TITLE = {Forming Connected Topologies in {B}luetooth Ad Hoc

Networks}, BOOKTITLE = {Manuscript}, YEAR = {2002}, MONTH = {Summer}}

@Article{GuhaK98, AUTHOR = {Guha, S. and Khuller, S.}, TITLE = {Approximation Algorithms for Connected Dominating Sets}, JOURNAL = {Algorithmica}, YEAR = {1998}, VOLUME = {20}, NUMBER = {4}, PAGES = {374--387}, MONTH = {April}}

@InProceedings{GummallaL00, AUTHOR = {Gummalla, A. and Limb, J.}, TITLE = {Wireless Collision Detect ({WCD}): Multiple Access with

Receiver Initiated Feedback and Carrier Detect Signal}, BOOKTITLE = {Proceedings of the IEEE ICC 2000}, PAGES = {397--401}, YEAR = {2000}, VOLUME = {1}, ADDRESS = {New Orleans, LA}, MONTH = {June}

}

@Article{GuptaK00, AUTHOR = {Gupta, P. and Kumar, P. R.}, TITLE = {The Capacity of Wireless Networks}, JOURNAL = {IEEE Transactions on Information Theory}, YEAR = {2000}, VOLUME = {46}, ONUMBER = {2}, PAGES = {388--404}, MONTH = {March}}

@InProceedings{GuptaY03a, AUTHOR = {Gupta, G. and Younis, M.}, TITLE = {Fault-Tolerant Clustering of Wireless Sensor Networks}, BOOKTITLE = {Proceedings of the IEEE Wireless Communications and


@InProceedings{GuptaY03b, AUTHOR = {Gupta, G. and Younis, M.}, TITLE = {Performance Evaluation of Load-Balanced Clustering of

Wireless Sensor Networks}, BOOKTITLE = {Proceedings of the $10$th International Conference on

Telecommunications (ICT 2003)}, PAGES = {1577--1583}, YEAR = {2003}, VOLUME = {2}, ADDRESS = {Papeete, French Polynesia}, MONTH = {February 23--March 1}}

@InProceedings{GuptaY03c, AUTHOR = {Gupta, G. and Younis, M.}, TITLE = {Load-Balanced Clustering of Wireless Sensor Networks}, BOOKTITLE = {Proceedings of the IEEE International Conference on

Communications (ICC 2003)}, PAGES = {1848--1852}, YEAR = {2003}, VOLUME = {3},

ADDRESS = {Anchorage, AK}, MONTH = {May 11--15}}

@Article{GuS05, AUTHOR = {Gu, L. and Stankovic, J. A.}, TITLE = {Radio-Triggered Wake-Up for Wireless Sensor Networks}, JOURNAL = {Real-Time Systems}, YEAR = 2005, VOLUME = 29, NUMBER = {2--3}, PAGES = {157--182}, MONTH = {March}}

@Book{GutierrezCB03, AUTHOR = {Gutierrez, J. A. and Callaway, Jr., E. H. and Barrett,

R.}, TITLE = {IEEE 802.15.4 Low-Rate Wireless Personal Area Networks:

Enabling Wireless Sensor Networks}, PUBLISHER= {IEEE Press}, YEAR = {2003}, ADDRESS = {Piscataway, NJ}, MONTH = {April}}

@InProceedings{GwonJ04, AUTHOR = {Gwon, Y. and Jain, R.}, TITLE = {Error Characteristics and Calibration-Free Techniques for

{LAN}-based Location Estimation}, BOOKTITLE = {Proceedings of the Second ACM International Workshop on

Mobility Management \& Wireless Access Protocols, ACM MobiWac 2004},

PAGES = {2--9}, YEAR = {2004}, ADDRESS = {Philadelphia, PA}, MONTH = {October 1}}

@Article{Haartsen00, AUTHOR = {Haartsen, J. C.}, TITLE = {The {B}luetooth Radio System}, JOURNAL = {IEEE Personal Communications}, VOLUME = 7, NUMBER = 1, PAGES = {28--36},

MONTH = {February}, YEAR = 2000}

@InProceedings{Haas97, AUTHOR = {Haas, Z. J.}, TITLE = {A New Routing Protocol for the Reconfigurable Wireless

Network}, BOOKTITLE = {Proceedings of the 1997 IEEE 6th International Conference

on Universal Personal Communications, ICUPC'97}, PAGES = {562--566}, ADDRESS = {San Diego, CA}, MONTH = {12--16 October}, YEAR = 1997, ABSTRACT = {We propose a new routing protocol, the Zone Routing

Protocol (ZRP), for the reconfigurable wireless networks, a large scale, highly mobile ad-hoc networking environment. The novelty of the ZRP protocol is that it is applicable to large flat-routed networks. Furthermore, through the use of the zone radius parameter, the scheme exhibits the adjustable hybrid behavior of proactive and reactive routing schemes. We evaluate the performance of the protocol, showing the reduction in the number of control messages, as compared with other reactive schemes, such as flooding (11 Refs.)}

}

@InProceedings{Haas97a, AUTHOR = {Haas, Z. J.}, TITLE = {On the Relaying Capability of the Reconfigurable Wireless

Networks}, BOOKTITLE = {Proceedings of the 1997 IEEE 47th Vehicular Technology

Conference. Technology in Motion}, PAGES = {1148--1152}, VOLUME = 2, ADDRESS = {Phoenix, AZ}, MONTH = {4-7 May}, YEAR = 1997, ABSTRACT = {In this paper, we evaluate the performance of an ad-hoc

network architecture, investigating the effect of various design and operational parameters on the blocking and dropping probabilities. In particular, we study the improvement in the network coverage due to the multi-hop routing feature. Furthermore, the effect of limiting the path length on the network performance is studied, showing that there is an optimal value for this parameter (6

Refs.)}}

@Article{Haas98, AUTHOR = {Haas, Z. J.}, TITLE = {Panel Report on Ad Hoc Networks---{M}ilcom'97}, JOURNAL = {Mobile Computing and Communications Review, {MC\,$^{2}$R},

a publication of the ACM SIGMOBILE}, VOLUME = 2, NUMBER = 1, PAGES = {15--18}, MONTH = {January}, YEAR = 1998}

@InProceedings{HaasHL02, AUTHOR = {Haas, Z. and Halpern, J. and Li, L.}, TITLE = {Gossip-Based Ad Hoc Routing}, BOOKTITLE = {Proceedings of IEEE Infocom 2002}, PAGES = {1707--1716}, YEAR = {2002}, VOLUME = {3}, ADDRESS = {New York, NY}, MONTH = {June 23--27}}

@Article{HaasL99, AUTHOR = {Haas, Z. J. and Liang, B.}, TITLE = {Ad Hoc mobility management with uniform quorum systems}, JOURNAL = {IEEE/ACM Transactions on Networking}, VOLUME = 7, NUMBER = 2, PAGES = {228--240}, MONTH = {April}, YEAR = 1999}

@Misc{HaasP97, AUTHOR = {Haas, Z. J. and Pearlman, M. R.}, TITLE = {The Zone Routing Protocol ({ZRP}) for Ad Hoc Networks}, HOWPUBLISHED = {INTERNET DRAFT---Mobile Ad hoc NETworking ({MANET})

Working Group of the Internet Engineering Task Force ({IETF})},

MONTH = {November}, YEAR = 1997

}

@Book{Halmos60, AUTHOR = {P. Halmos}, TITLE = {Naive Set Theorie}, PUBLISHER= {D. Van Nostrand}, YEAR = 1960}

@InProceedings{HandzinskiKKF04, AUTHOR = {Handzinski, V. and K\"opke, A. and Karl, H. and Frank, C.

and Drytkiewicz, W.}, TITLE = {Improving the Energy Efficinecy of Directed Diffusion

Using Passive Clustering}, BOOKTITLE = {Proceedings of the $1$st IEEE European Workshop on

Wireless Sensor Networks (EWSN 2004), LNCS 2920}, PAGES = {172--187}, YEAR = {2004}, ADDRESS = {Berlin, Germany}, MONTH = {January 19--21}}

@Book{Harary69, AUTHOR = {F. Harary}, TITLE = {Graph Theory}, PUBLISHER= {Addison--Wesley}, YEAR = 1969}

@Book{Harris63, AUTHOR = {Harris, T. E.}, TITLE = {The Theory of Branching Processes}, PUBLISHER= {Springer Verlag and Prentice Hall, Inc.}, ADDRESS = {Berlin, Germany and Englewood Cliffs, NJ}, YEAR = {1963}}

@Book{HarrisB88, AUTHOR = {Harris, W. M. and Bennet, D. W.}, TITLE = {Practical use of the Global Positioning System}, PUBLISHER= {Dept. of the Interior, U.S. Geological Survey}, SERIES = {U.S. Geological Survey open-file report;88-103}, YEAR = 1988}

@InProceedings{HarrisZ07,

AUTHOR = {Harris, A. F. and Zorzi, M.}, TITLE = {Energy-efficient Routing Protocol Design Considerations

for Underwater Networks}, BOOKTITLE = {Proceedings of IEEE SECON 2007}, YEAR = {2007}}

@InProceedings{HarrisZS06, AUTHOR = {Harris, A. F. and Zorzi, M. and Stojanovic, M.}, TITLE = {When Underwater Acoustic Nodes Should Sleep With One Eye

Open: Idle-time Power Management in Underwater Sensor Networks},

BOOKTITLE = {Proceedings of the First ACM International Workshop on UnderWater Networks, WuWNet 2006},

YEAR = {2006}, ADDRESS = {Los Angeles, CA}, MONTH = {September 25}}

@Article{HartensteinL08, AUTHOR = {Hartenstein, H. and Laberteaux, K. P.}, TITLE = {Topics in Ad Hoc and Sensor Networks---{A} Tutorial Survey

on Vehicular Ad Hoc Networks}, JOURNAL = {IEEE Communications Magazine}, VOLUME = 46, NUMBER = 6, PAGES = {164--171}, MONTH = {June 6}, YEAR = 2008}

@Book{Hartigan75, AUTHOR = {Hartigan, J. A.}, TITLE = {Clustering Algorithms}, SERIES = {Probability and Mathematical Statistics}, PUBLISHER= {John Wiley \& Sons, Inc}, ADDRESS = {Hoboken, NJ}, YEAR = 1975}

@InProceedings{HartungG97, AUTHOR = {Hartung, F. and Girod, B.}, TITLE = {Digital watermarking of {MPEG}-2 coded video in the

bitstream domain}, BOOKTITLE = {Proceedings of the 1997 IEEE International Conference on

Acoustics, Speech, and Signal},

VOLUME = 4, PAGES = {2621--2624}, ADDRESS = {Munich, Germany}, MONTH = {21--24 April}, YEAR = 1997, ABSTRACT = {Embedding information into multimedia data, also called

watermarking, is a topic that has gained increased attention. For video broadcast applications, watermarking schemes operating on compressed video are desirable. We present a scheme for robust watermarking of MPEG-2 encoded video. The watermark is embedded into the MPEG-2 bitstream without increasing the bit-rate, and can be retrieved even from the decoded video and without knowledge of the original, unwatermarked video. The scheme is robust and of much lower complexity than a complete decoding process followed by watermarking in the pixel domain and re-encoding. Although an existing MPEG-2 bitstream is partly altered, the scheme avoids visible artifacts by adding a drift compensation signal. The scheme has been implemented and the results confirm that a robust watermark can be embedded into MPEG encoded video which can be used to securely transmit arbitrary binary information at a data rate of several bytes/second. The scheme is also applicable to other hybrid coding schemes like MPEG-1, H.261, and H.263. (12 References).}

}

@Article{HartungG98a, AUTHOR = {Hartung, F. and Girod, B.}, TITLE = {Watermarking of uncompressed and compressed video}, JOURNAL = {Signal Processing}, VOLUME = 66, NUMBER = 3, PAGES = {283--301}, MONTH = {May}, YEAR = 1998, ABSTRACT = {Methods for embedding additive digital watermarks into

uncompressed and Methods for embedding additive digital watermarks into uncompressed and compressed video sequences are presented. The basic principle borrows from spread spectrum communications. It consists of addition of an encrypted, pseudo-noise signal to the video that is invisible, statistically unobtrusive, and robust against manipulations. For practical applications, watermarking schemes operating on compressed video are desirable. A method for watermarking of MPEG-2 encoded video is

presented. The scheme is a compatible extension of the scheme operating on uncompressed video. The watermark is generated exactly in the same manner as for uncompressed video, transformed using the discrete cosine transform (DCT) and embedded into the MPEG-2 bit-stream without increasing the bit-rate. The watermark can be retrieved from the decoded video and without knowledge of the original, unwatermarked video. Although an existing MPEG-2 bit-stream is partly altered, the scheme avoids visible artifacts by addition of a drift compensation signal. The proposed method is robust and of much lower complexity than a complete decoding process followed by watermarking in the pixel domain and re-encoding. Fast implementations exist which have a complexity comparable to a video decoder. Experimental results are given. The scheme is also applicable to other hybrid transform coding schemes like MPEG-1, MPEG-4, H.261, and H.263. (32 References).}

}

@InProceedings{HartungG98b, AUTHOR = {Hartung, F. and Girod, B.}, TITLE = {Watermarking of Raw and Compressed Video}, BOOKTITLE = {Proceedings of SPIE, Digital Compression Technologies and

Systems for Video Communications}, VOLUME = 2952, PAGES = {205--213}, ADDRESS = {Berlin, Germany}, MONTH = {7--9 October}, YEAR = 1996, ABSTRACT = {Embedding information into multimedia data is a topic that

has gained increasing attention recently. For video broadcast applications, watermarking of video, and especially of already encoded video, is interesting. We present a scheme for robust interoperable watermarking of MPEG-2 encoded video. The watermark is embedded either into the uncoded video or into the MPEG-2 bitstream, and can be retrieved from the decoded video. The scheme working on encoded video is of much lower complexity than a complete decoding process followed by watermarking in the pixel domain and re-encoding. Although an existing MPEG-2 bitstream is partly altered, the scheme avoids drift problems. The scheme has been implemented and practical results show that a robust watermark can be embedded into MPEG-encoded video which can be used to transmit arbitrary binary information at a data rate of several bytes/second. (10 References).}

}

@InProceedings{Hastad96, AUTHOR = {H{\aa}stad, J.}, TITLE = {Clique is hard to approximate within $n^{1-\epsilon}$}, BOOKTITLE = {Proceedings of the $37$th Annual Symposium on Foundations

of Computer Science}, ADDRESS = {Burlington, VT}, MONTH = {14--16 October}, YEAR = 1996, PAGES = {627--636}}

@Article{HausmannK78, AUTHOR = {Hausmann, D. and Korte, B.}, TITLE = {Lower bounds on the worst-case complexity of some oracle

algorithms}, JOURNAL = DM, VOLUME = 24, NUMBER = 3, PAGES = {261--276}, MONTH = {December}, YEAR = 1978, ABSTRACT = {To give a proper definition of the complexity of very

general computational problems such as optimization problems over arbitrary independence systems or fixed-point problems for continuous functions, it is useful to consider the input for these problems as 'oracles' R which can be called by the algorithms for some values x in X and which then give back some information R(x) about x, e.g. whether x belongs to the independence system or the point into which x is mapped by the continuous function. A lower bound on the complexity of an algorithm using an oracle R is the number of calls on R in the worst case. Using this technique it is shown that there is no polynomial approximative algorithm for the maximization or minimization problem over a general independence system which has a better worst-case behaviour than the greedy algorithm. Moreover several formalizations of the problem of approximating a fixed point of a continuous function are considered, and it is shown that none of these problems can be solved by a bounded algorithm (14 Refs.)}

}

@Article{HausmannK78a, AUTHOR = {Hausmann, D. and Korte, B.},

TITLE = {An Analysis of the Greedy Heuristic for Indepedence Systems},

JOURNAL = ADM, VOLUME = 2, PAGES = {65--74}, YEAR = 1978, ABSTRACT = {(tec rep )The heuristic is a method of selecting subsets

from a give set having certain recursive properties. A number of results related to the method is proved (8 Refs.)}

}

@Article{HausmannK78b, AUTHOR = {Hausmann, D. and Korte, B.}, TITLE = {$K$-greedy algorithms for independence systems}, JOURNAL = {Zeitschrift fur Operations Research, Serie A (Theorie)}, VOLUME = 22, NUMBER = 5, PAGES = {219-228}, MONTH = {October}, YEAR = 1978, ABSTRACT = {Recently in Jenkyns (1976) and Korte/Hausmann (1978) a

tight worst-case bound for the well-known greedy heuristic for general independence systems has been deduced. Some modifications of the greedy heuristic are investigated which allow enlargement of the current independent set by more than one element. It is shown that in spite of the additional enumeration incorporated in these heuristics they can behave worse than the usual greedy heuristic for some problem instances. For one of those modifications the same worst-case bound a mentioned above has been proved again. These results underline the predominant role of the usual greedy heuristic for general independence systems (4 Refs.)}

}

@InProceedings{HavingaEKP03, AUTHOR = {Havinga, P. J. M. and Etalle, S. and Karl, H. and

Petrioli, C. and Zorzi, M. and Kip, H and Lentsch, T.}, TITLE = {{EYES}---Energy Efficient Sensor Networks}, BOOKTITLE = {Proceedings of the $4$th IFIP TC6/WG6.8 International

Conference on Personal Wireless Communications ({PWC}) LNCS 2775, M.~Conti, S.~Giordano, E.~Gregori and S.~Olariu (eds.)},

PAGES = {198--201}, YEAR = {2003},

ADDRESS = {Venezia, Italy}, MONTH = {September 23--25}}

@InProceedings{HeHBSA03, AUTHOR = {He, T. and Huang, C. and Blum, B. M. and Stankovic, J. A.

and Abdelzahe, T.}, TITLE = {Range-free Localization Schemes in Large Scale Sensor

Networks}, BOOKTITLE = {Proceedings of the $9$th {ACM} Annual International


PAGES = {81--95}, YEAR = {2003}, ADDRESS = {San Diego, CA}, MONTH = {September 14--19}}

@InProceedings{HeidemannYWSL06, AUTHOR = {Heidemann, J. and Ye, W. and Willis, J. and Syed, A. A. and Li, Y.}, TITLE = {Research challenges and applications for underwater sensor networking}, BOOKTITLE = {Proceedings of the IEEE Wireless Communications and Networking Conference, WCNC 2006}, PAGES = {229--235}, ADDRESS = {Las Vegas, NV}, MONTH = {April 3--6}, YEAR = {2006}}

@PhDThesis{Heinzelman00, AUTHOR = {Heinzelman Rabiner, W.}, TITLE = {Application-specific protocol architectures for wireless

networks}, SCHOOL = {MIT}, YEAR = {2000}, MONTH = {June}}

@InProceedings{HeinzelmanCB00, AUTHOR = {Heinzelman, W. R. and Chandrakasan, A. and Balakrishnan,

H.}, TITLE = {Energy-Efficient Communication Protocol for Wireless

Microsensor Networks}, BOOKTITLE = {Proceedings of the $33$rd Annual Hawaii International

Conference on System Sciences, HICSS 2000},

PAGES = {3005--3014}, ADDRESS = {Maui, HA}, MONTH = {January 4--7}, YEAR = {2000}}

@Article{HekmatM06, AUTHOR = {Hekmat, R. and {Van Mieghem}, P.}, TITLE = {Connectivity in Wireless Ad-hoc Networks with a Log-normal

Radio Model}, JOURNAL = {ACM/Kluwer Mobile Networks and Applications (MONET)}, VOLUME = 11, NUMBER = 3, PAGES = {351--360}, MONTH = {June}, YEAR = 2006}

@Book{HillierL05, AUTHOR = {Hillier, F. S. and Lieberman, G. J.}, TITLE = {Introduction to Operations Research}, PUBLISHER= {McGraw Hill}, YEAR = {2005}, ADDRESS = {Boston, MA}, EDITION = {eighth}}

@Article{HoA97, AUTHOR = {Ho, J. S. M. and Akyildiz, I. F.}, TITLE = {Mobile User Location Update and Paging Under Delay

Constraints}, JOURNAL = {Wireless Networks}, VOLUME = 1, NUMBER = 4, PAGES = {413--425}, MONTH = {December}, YEAR = 1997}

@Book{Hofmann-WellenhofLC97, AUTHOR = {Hofmann-Wellenhof, B. and Lichtenegger, H. and Collins,

J.}, TITLE = {Global positioning system : theory and practice}, EDITION = {4th, rev.}, PUBLISHER= {Springer-Verlag}, ADDRESS = {Wien, New York},

YEAR = {1997}}

@Article{Hopper94, AUTHOR = {Hopper, A.}, TITLE = {Communications at the Desktop}, JOURNAL = {Computer Networks and ISDN Systems}, VOLUME = 26, NUMBER = 10, PAGES = {1253--1265}, MONTH = {July}, YEAR = 1994, ABSTRACT = {Two approaches for improving communications at the desktop

are presented together with experience of use. The first employs desktop cameras attached to networked workstations (Pandora). The most popular applications are video-phone and video-mail. An enhanced system which increases the number of cameras is described (Medusa). The second deals with location of personnel in a building using infra-red (Active Badge). The system has proved popular because by making the information available at every desktop the amount of time spent locating others has been reduced. Finally a framework is outlined for a system which combines these approaches and makes it possible to personalise the computer and communications environment (Active Office Environment) (13 Refs.)}

}

@Misc{HoreyM05, AUTHOR = {Horey, J. and Maccabe, A.}, TITLE = {BosqueNet: Studying the Behavior of Porcupines in the

Bosque}, HOWPUBLISHED = {http://cs.unm.edu/~jhorey/research/}, YEAR = {2005}}

@InProceedings{HouL84, AUTHOR = {Hou, T.-C. and Li, V. O. K.}, TITLE = {Performance Analysis of Routing Strategies in Multihop

Packet Radio Networks}, BOOKTITLE = {Proceedings of the IEEE Global Telecommunications

Conference, GLOBECOM'84}, PAGES = {487--492}, ADDRESS = {Atlanta, GA}, MONTH = {26-29 November}, YEAR = 1984,

ABSTRACT = {A model is presented for analyzing the performance of routing strategies in a packet radio network where each station has an adjustable transmission radius. Previous research has focused on the case where the transmission radius is fixed or is the same for each station. The authors illustrate their model by comparing three routing strategies. Results show that the best strategy is for each station to transmit to its nearest neighbor by using adjustable transmission power (6 Refs.)}

}

@Article{HouL86, AUTHOR = {Hou, T.-C. and Li, V. O. K.}, TITLE = {Transmission Range Control in Multihop Packet Radio

Networks}, JOURNAL = {IEEE Transactions on Communications}, VOLUME = {COM-34}, NUMBER = 1, PAGES = {38--44}, MONTH = {January}, YEAR = 1986, ABSTRACT = {A model is presented for analyzing the performance of

transmission strategies in a multihop packet radio network where each station has adjustable transmission radius. A larger transmission radius will increase the probability of finding a receiver in the desired direction and contribute more toward progress if the transmission is successful, but it also has a higher probability of collision with other transmissions. The converse is true for shorter transmission range. The model is illustrated by comparing three transmission strategies. The results show that the network can achieve better performance by suitably controlling the transmission range. One of the transmission strategies, namely transmitting to the nearest forward neighbor by using adjustable transmission power, has desirable features in a high-terminal-density environment (9 Refs.)}

}

@Article{HowardMS02, AUTHOR = {Howard, A. and Matari\'c, M. J. and Sukhatme, G. S.}, TITLE = {An Incremental Deployment Algorithm for Mobile Sensor

Networks}, JOURNAL = {Kluwer Autonomous Robots, Special Issue on Intelligent

Embedded Systems (G.S.~Sukhatme, editor)}, YEAR = {2002},

VOLUME = {13}, NUMBER = {2}, PAGES = {113--126}, MONTH = {September}}

@InProceedings{HowardMS02a, AUTHOR = {Howard, A. and Matari\'c, M. J. and Sukhatme, G. S.}, TITLE = {Mobile Sensor Networks Deployment using Potential Fields:

A Distributed, Scalable Solution to the Area Coverage Problem},

BOOKTITLE = {Proceedings of the $6$th International Symposium on Distributed Autonomous Robotic Systems, DARS 2002},

YEAR = {2002}, ADDRESS = {Fukuoka, Japan}, MONTH = {June 25--27}}

@InProceedings{HowardMS02b, AUTHOR = {Howard, A. and Matari\'c, M. J. and Sukhatme, G. S.}, TITLE = {An Incremental Deployment Algorithm for Mobile Robot

Teams}, BOOKTITLE = {Proceedings of the 2002 IEEEE/RSJ Conference on

Intelligent Robot and Systems}, YEAR = {2002}, ADDRESS = {EPFL, Lausanne, Switzerland}, MONTH = {September 30--October 4}}

@InProceedings{HuangCHH05, AUTHOR = {Huang, H.-J and Chang, T.-H. and Hu, S. Y. and Huang, P.}, TITLE = {Magnetic Diffusion: Disseminating Mission Critical Data

for Dynamic Sensor Networks}, BOOKTITLE = {Proceedings of the $8$th ACM/IEEE International Symposium

on Modeling, Analysis and Simulations of Wireless and Mobile Systems, MSWiM 2005},

PAGES = {4607--4610}, YEAR = {2005}, ADDRESS = {Montreal, QC, Canada}, MONTH = {October 10--13}}

@InProceedings{HuJ00, AUTHOR = {Hu, Y.-C. and Johnson, D. B.}, TITLE = {Caching Stragies in On-Demand Routing Protocols for

Wireless Ad Hoc Networks},

BOOKTITLE = {Proceedings of the Sixth Annual ACM International Conference on Mobile Computing and Networking, MobiCom 2000},

PAGES = {231--242}, ADDRESS = {Boston, MA}, MONTH = {6--11 August}, YEAR = 2000}

@Article{HuLLS04, AUTHOR = {Hu, X. and Liu, Y. and Lee, M. J. and Saadawi, T. N.}, TITLE = {A Novel Route Update Design for Wireless Sensor Networks}, JOURNAL = {ACM Mobile Computing and Communications Review}, YEAR = {2004}, VOLUME = {8}, NUMBER = {1}, PAGES = {18--26}, MONTH = {January}}

@Article{Hwang95, AUTHOR = {Hwang, F. K.}, TITLE = {The Time Complexity of Deterministic Broadcast Radio

Netowrks}, JOURNAL = DAM, VOLUME = 60, NUMBER = {1--3}, PAGES = {219--222}, MONTH = {23 June}, YEAR = 1995, ABSTRACT = {R. Bar-Yehuda, O. Goldreich and A. Itai (1987) studied

both the probabilistic and the deterministic time complexity of broadcast in a multihop network. They show that in the deterministic case the number of time-slots needed for successful broadcast is lower bounded by the numbers of moves of two associated games. They also obtain lower bounds for the numbers of moves in these games. In this paper we determine the exact numbers of moves and time-slots needed in the games and in broadcasting (1 Refs.)}

}

@InProceedings{HwangIYE04, AUTHOR = {Hwang, K. and In, J. and Yun, Y. and Eom, D.}, TITLE = {Dynamic Sink Oriented Tree Algorithm for Efficient Target

Traking of Multiple Mobile Sink Users in Wide Sensor

Fields}, BOOKTITLE = {Proceedings of the $60$th IEEE Vehicular Technology

Conference, VTC 2004 Fall}, PAGES = {134--141}, YEAR = {2004}, VOLUME = {7}, ADDRESS = {Los Angeles, CA}, MONTH = {September 26--29}}

@Book{HwangRW92, AUTHOR = {Hwang, F. K. and Richards, D. S. and Winter, P.}, TITLE = {The {S}teiner Tree Problem}, SERIES = {Annals of Discrete Matematics}, NUMBER = 53, PUBLISHER= {North-Holland}, ADDRESS = {The Netherlands}, YEAR = 1992}

@Article{IEEEComm36-6, AUTHOR = {IEEE Communications Magazine}, TITLE = {Special {I}ssue on {W}ireless {V}ideo}, JOURNAL = {IEEE Communications Magazine}, VOLUME = 36, NUMBER = 6, MONTH = {June}, YEAR = 1998}

@Article{IEEEJsac16-4, AUTHOR = {IEEE Journal of Selected Areas in Communications}, TITLE = {Special {I}ssue on {C}opyright and {P}rivacy

{P}rotection}, JOURNAL = {IEEE JSAC}, VOLUME = 16, NUMBER = 4, MONTH = {May}, YEAR = 1998}

@InProceedings{IntanagonwiwatEGH02, AUTHOR = {Intanagonwiwat, C. and Estrin, D. and Govindan, R. and

Heidemann, J.}, TITLE = {Impact of Network Density on Data Aggregation in Wireless

Sensor Networks},

BOOKTITLE = {Proceedings of the International Conference in Distributed Computing Systems, ICDCS 2002)},

ADDRESS = {Vienna, Austria}, MONTH = {July}, YEAR = 2002}

@InProceedings{IntanagonwiwatGE00, AUTHOR = {Intanagonwiwat, C. and Govindan, R. and Estrin, D.}, TITLE = {Directed Diffusion: A Scalable and Robust Communication

Paradigm for Sensor Networks}, BOOKTITLE = {Proceedings of the Sixth Annual ACM International


PAGES = {56--67}, ADDRESS = {Boston, MA}, MONTH = {6--11 August}, YEAR = 2000}

@Article{IntanagonwiwatGEHS03, AUTHOR = {Intanagonwiwat, C. and Govindan, R. and Estrin, D. and

Heidemann, J. and Silva, F.}, TITLE = {Directed Diffusion for Wireless Sensor Networking}, JOURNAL = {IEEE/ACM Transactions on Networking}, VOLUME = 11, NUMBER = 1, PAGES = {2--16}, MONTH = {February}, YEAR = 2003}

@Misc{JacobsC99, AUTHOR = {Jacobs, S. and Corson, M. S.}, TITLE = {MANET Authentication Architecture}, HOWPUBLISHED = {MANET draft-jacobs-imep-auth-arch-00.txt, work in

progress}, MONTH = {March}, YEAR = {1999}}

@Book{Jain91, AUTHOR = {Jain, R.}, TITLE = {The Art of Computer Systems Performance Analysis:

Techniques for experimental Design, Measurement, Simulation, and Modeling},

PUBLISHER= {John Wiley and Sons, Inc.}, ADDRESS = {Hoboken, NJ}, YEAR = 1991}

@InProceedings{JainMA03, AUTHOR = {Jain, N. and Madathil, D. K. and Agrawal, D. P.}, TITLE = {Energy Aware Multi-Path Routing for Uniform Resource

Utilization in Sensor Networks}, BOOKTITLE = {Proceedings of the Second International Workshop on

Information Processing in Sensor Networks, IPSN 2003}, PAGES = {473--487}, YEAR = {2003}, VOLUME = {2634}, SERIES = {Springer LNCS}, ADDRESS = {Palo Alto, CA}, MONTH = {April 22--23}}

@InProceedings{JainSBBR04, AUTHOR = {Jain, S. and Shah, R. C. and Brunette, W. and Borriello,

G. and Roy, S.}, TITLE = {Exploiting Mobility for Energy-Efficient Data Collection

in Sensor Networks}, BOOKTITLE = {Proceedings of the IEEE Workshop on Modeling and

Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2004},

YEAR = {2004}, ADDRESS = {Cambridge, UK}, MONTH = {March 24--26}}

@Article{JanninkLSWC97, AUTHOR = {Jannink, J. and Lam, D. and Shivakumar, N. and Widom, J.

and Cox, D. C.}, TITLE = {Efficient and Flexible Location Management Techniques for

Wireless Communication Systems}, JOURNAL = {Wireless Networks, special issue on Mobile Computing and

Networking}, EDITOR = {Hass, Z. J and Akyildiz, I. F.}, VOLUME = 3, NUMBER = 5, PAGES = {447--455}, MONTH = {October}, YEAR = 1997}

@InProceedings{JardoshBAS03, AUTHOR = {Jardosh, A. and Belding-Royer, E. M. and Almeroth, K. C.

and Suri, S.}, TITLE = {Towards Realistic Mobility Models for Mobile Ad Hoc

Networks}, BOOKTITLE = {Proceedings of the $9$th Annual ACM International



@Article{JaromczikT92, AUTHOR = {Jaromczik, J. W. and Toussaint, G. T.}, TITLE = { Relative neighborhood graphs and their relatives }, JOURNAL = {Proceedings of the IEEE}, YEAR = {1992}, VOLUME = {80}, NUMBER = {9}, PAGES = {1502--1517}, MONTH = {}}

@InProceedings{JeaSS05, AUTHOR = {Jea, D. D. and Somasundara, A. A. and Srivastava, M. B.}, TITLE = {Multiple Controlled Mobile Elements (Data Mules) for Data

Collection in Sensor Networks}, BOOKTITLE = {Proceedings of the $1$st IEEE International Conference on

Distributed Computing in Sensor Systems, DCOSS 2005}, PAGES = {244--257}, EDITOR = {Prasanna, V. K. and Iyengar, S. and Spirakis, P. G. and

Welsh, M.}, VOLUME = {3560}, SERIES = {LNCS}, YEAR = {2005}, ADDRESS = {Marina del Rey, CA}, MONTH = {June 30--July 1}}

@InProceedings{JetchevaJ01, AUTHOR = {Jetcheva, J. G. and Johnson, D. B.}, TITLE = {Adaptive Demand-Driven Multicast Routing in Multi-Hop

Wireless Ad Hoc Networks},

BOOKTITLE = {Proceedings of the $2$nd ACM International Symposium on Mobile Ad Hoc Networking \& Computing, MobiHoc 2001},

PAGES = {33--44}, YEAR = {2001}, ADDRESS = {Long Beach, CA}, MONTH = {October 4--5}}

@Article{JiaRS02, AUTHOR = {Jia, L. and Rajaraman, R. and Suel, T.}, TITLE = {An Efficient Distributed Algorithm for Constructing Small

Dominating Sets}, JOURNAL = {Distributed Computing}, YEAR = {2002}, VOLUME = {15}, NUMBER = {4}, PAGES = {193--205}, MONTH = {December}}

@InProceedings{JohanssonKKG02, AUTHOR = {Johansson, P. and Kapoor, R. and Kazantzidis, M. and

Gerla, M.}, TITLE = {Rendezvous Scheduling in {B}luetooth Scatternets}, BOOKTITLE = {Proceedings of IEEE ICC 2002}, PAGES = {318--324}, YEAR = {2002}, VOLUME = {1}, ADDRESS = {New York, NY}, MONTH = {April 28--May 2}}

@InProceedings{JohnenN07, AUTHOR = {Johnen, C. and Nguyen, L. H.}, TITLE = {Self-Stabilizing Weight-Based Clustering Algorithm for Ad

Hoc Sensor Networks}, BOOKTITLE = {Proceedings of the $2$nd International Workshop on

Algorithmic Aspects of Wireless Sensor Networks, ALGOSENSOR 2006},

PAGES = {83--94}, YEAR = 2006, ADDRESS = {Venice, Italy}, MONTH = {June 15}}

@Article{Johnson85,

AUTHOR = {Johnson, D. S.}, TITLE = {The {NP}-completeness column: an ongoing guide}, JOURNAL = {Journal of Algorithms}, VOLUME = 6, NUMBER = 3, PAGES = {434--451}, YEAR = 1985}

@InCollection{JohnsonM96, AUTHOR = {Johnson, D. and Maltz, D. A.}, TITLE = {Dynamic Source Routing in Ad Hoc Wireless Networks}, BOOKTITLE = {Mobile Computing}, EDITOR = {Imielinski, T. and Korth, H. F.}, PUBLISHER= {Kluwer Academic Publishers}, ADDRESS = {Dordrecht, The Netherlands}, CHAPTER = 5, PAGES = {153--181}, MONTH = {February}, YEAR = 1996}

@InProceedings{JohnsonS85, AUTHOR = {Johnson, R. E. and Schneider, F. B.}, TITLE = {Symmetry and Similarity in Distributed Systems}, BOOKTITLE = {Proceedings of the $4$th Annual ACM Symposium on

Principles of Distributed Computing}, PAGES = {13--22}, ADDRESS = {Minaki, Ontario}, MONTH = {August 5-7}, YEAR = 1985, ABSTRACT = {(TR 85-677) Similarity is introduced as a

model-independent characterization of symmetry. It can be used to decide when a concurrent system has a solution to the selection problem. It can also be used to compare different models of parallel computation, including differences in scheduling policy and instruction set, and the consequences of using randomization (18 Refs.)}

}

@inproceedings{JohnsonRPBCLP08,author = {Matthew P. Johnson and Hosam Rowaihy and Diego Pizzocaro and

Amotz Bar-Noy and Stuart Chalmers and Thomas La Porta and Alun Preece}, title = {Frugal Sensor Assignment}, booktitle = {Proceedings of the $4$th IEEE international conference on Distributed Computing in Sensor Systems, DCOSS 2008},

year = {2008}, pages = {219--236}, location = {Santorini Island, Greece},}

@InProceedings{JollyKKY03, AUTHOR = {Jolly, G. and Kuscu, M. C. and Kokate, P. and Younis, M.}, TITLE = {A Low-Energy Key Management Protocol for Wireless Sensor

Networks}, BOOKTITLE = {Proceedings of the $8$th IEEE International Symposium on


@Misc{Jornet08, AUTHOR = {Jornet, J. M.}, TITLE = {{AUVN}et{S}im: A Simulator for Underwater Acoustic

Networks}, HOWPUBLISHED = {MIT Sea Grant Technical Report}, YEAR = {2008}, NOTE = {http://seagrant.mit.edu/media/publications/MITSG08-4.pdf}}

@InProceedings{JuangOWMPR02, AUTHOR = {Juang, P. and Oki, H. and Wang, Y. and Martonosi, M. and

Peh, L.-S. and Rubenstein, D.}, TITLE = {Energy-Efficient Computing for Wildlife Tracking: Design

Tradeoffs and Early Experiences with {Z}ebra{N}et}, BOOKTITLE = {Proceedings of the $10$th International Conference on

Architectural Support for Programming Languages and Operating Systems, ASPLOS-X},

PAGES = {96--107}, YEAR = {2002}, ADDRESS = {San Jose, CA}, MONTH = {October 5--9}}

@InProceedings{JunZAZL05, AUTHOR = {Jun, H. and Zhao, W. and Ammar, M. H. and Zegura, E. W.

and Lee, C.}, TITLE = {Trading Latency for Energy in Wireless Ad Hoc Networks

Using Message Ferrying}, BOOKTITLE = {Proceedings of the $3$rd IEEE International Conference on

Pervasive Computing and Communications, PerCom 2005}, PAGES = {220--225}, YEAR = {2005}, ADDRESS = {Kawai, HA}, MONTH = {March 8--12}}

@InProceedings{KaletskyES96, AUTHOR = {Kaletsky, K. and Earle, J. R. and Schneider, T. A.}, TITLE = {Integrating GIS and GPS in Environmental Remediation

Oversight}, BOOKTITLE = {Proceedings of Meeting on Global Networks for

Environmental Information: Bridging the Gap Between Knowledge and Application},

PAGES = {173--178}, VOLUME = 1, ADDRESS = {Lake Buena Vista, FL}, MONTH = {November 4--7}, YEAR = 1996, ABSTRACT = {This paper presents findings on Ohio EPA Office of Federal

Facilities Oversight's (OFFO) use of GIS and GPS for environmental remediation oversight at the USA Department of Energy's (DOE) Fernald site. The Fernald site is a former uranium metal production facility within DOE's nuclear weapons complex. Significant uranium contamination of soil and groundwater is being remediated under state and federal regulations. OFFO uses GIS/GPS to enhance environmental monitoring and remediation oversight. These technologies are utilized within OFFO's environmental monitoring program for sample location and parameter selection, data interpretation and presentation. GPS is used to integrate sample data into OFFO's GIS and for permanently linking precise and accurate geographic data to samples and waste units. It is important to identify contamination geographically as all visual references (e.g., buildings, infrastructure) will be removed during remediation. Availability of the GIS allows OFFO to perform independent analysis and review of DOE contractor- generated data, models, maps, and designs. This ability helps alleviate concerns associated with ``black box'' models and data interpretation. OFFO's independent analysis has increased regulatory confidence and the efficiency of design reviews. GIS/GPS technology allows OFFO to record and present complex data in a visual format aiding in stakeholder education and awareness. We present OFFO's achievements within the aforementioned activities and some

lessons learned in implementing the GIS/GPS program (0 Refs.)}

}

@InProceedings{KalvaYW05, AUTHOR = {Kalva, R. R. and Youn, J.-H. and Won, C.}, TITLE = {On-Demand Data Dissemination in Large Wireless Sensor

Networks}, BOOKTITLE = {Proceedings of the $62$nd IEEE Vehicular Technology

Conference, VTC 2005 Fall}, PAGES = {2711--2715}, YEAR = {2005}, VOLUME = {4}, ADDRESS = {Dallas, TX}, MONTH = {September 25--28}}

@Book{Kamke50, AUTHOR = {E. Kamke}, TITLE = {Theory of Sets}, PUBLISHER= {Dover}, YEAR = 1950, NOTE = {From German {\em Mengenlehere}}}

@Article{KamounK77, AUTHOR = {Kampoun, F. and Kleinrock, L.}, TITLE = {Hierarchical Routing for Large Networks-Performance

Evaluation and Optimization}, JOURNAL = CN, VOLUME = 1, NUMBER = 3, PAGES = {155--174}, MONTH = {January}, YEAR = 1977, ABSTRACT = {Distributed adaptive routing has proven to be useful in

packet switching networks. However, the storage and updating cost of this routing procedure becomes prohibitive as the number of nodes in the network gets large. This paper deals with the specification, analysis and evaluation of some hierarchical routing procedures which are effective for large store-and-forward packet-switched computer networks. The procedures studied are an extension of present techniques and rely on a hierarchical clustering of the network nodes. In particular, optimal clustering structures are determined so as to minimize the length of

the routing tables required. A price for reducing the table length is the increase in the average message path length in the network. Bounds are derived to evaluate the maximum increase in path length for a given table length. In the limit of a very large network, enormous table reduction may be achieved with essentially no increase in network path length (30 Refs.)}

}

@InProceedings{KansalREKPS04, AUTHOR = {Kansal, A. and Rahimi, M. and Estrin, D. and Kaiser, W. J.

and Pottie, G. J. and Srivastava, M. B.}, TITLE = {Controlled Mobility for Sustainable Wireless Sensor

Networks}, BOOKTITLE = {Proceedings of the First IEEE Annual Conference on Sensor

and Ad Hoc Communications and Networks, SECON 2004}, PAGES = {1-6}, YEAR = {2004}, ADDRESS = {Santa Clara, CA}, MONTH = {October 4--7}}

@InProceedings{KansalSJSE04, AUTHOR = {Kansal, A. and Somasundara, A. A. and Jea, D. D. and

Srivastava, M. B. and Estrin, D.}, TITLE = {Intelligent Fluid Infrastructure for Embedded Networks}, BOOKTITLE = {Proceedings of the $2$nd ACM/SIGMOBILE International

Conference on Mobile Systems, Applications, and Services, MobySys 2004},

PAGES = {111--124}, YEAR = {2004}, ADDRESS = {Boston, MA}, MONTH = {June 6--9}}

@InProceedings{KantorSPRDKPS03, AUTHOR = {Kantor, G. and Singh, S. and Peterson, R. and Rus, D. and

Das, A. and Kumar, V. and Pereira, G. and Spletzer, J.}, TITLE = {Distributed Search and Rescue with Robot and Sensor Team}, BOOKTITLE = {Proceedings of the $4$th International Conference on Field

and Service Robotics, FSR 2003}, PAGES = {327--332}, YEAR = {2003}, ADDRESS = {Lake Yamanaka, Japan}, MONTH = {July}}

@Book{Kaplan96, EDITOR = {Kaplan, E. D.}, TITLE = {Understanding GPS: Principles and Applications}, PUBLISHER= {Artech House}, ADDRESS = {Boston, MA}, YEAR = {1996}}

@InProceedings{Karger95, AUTHOR = {Karger, D. R.}, TITLE = {A Randomized Fully Polynomial Approximation Scheme for the

All Terminal Network Reliability Problem}, BOOKTITLE = {Proceedings of the $27$th Annual ACM Symposium on Theory

of Computing, STOC 1995}, PAGES = {11-17}, YEAR = {1995}, ADDRESS = {Las Vegas, NV}, MONTH = {May 29--June 1}}

@InProceedings{Karn90, AUTHOR = {Karn, P.}, TITLE = {MACA---A New Channel Access Protocol for Packet Radio}, BOOKTITLE = {Proceedings of ARRL/CRRL Amateur Radio $9$th Computer

Networking Conference}, PAGES = {134--140}, YEAR = {1990}}

@InCollection{Karp72, AUTHOR = {Karp, R. M.}, TITLE = {Reducibility among Combinatorial Problems}, BOOKTITLE = {Complexity of Computer Computations}, EDITOR = {R.E. Miller and J.W.Thatcher}, PUBLISHER= {Plenum Press}, ADDRESS = {New York}, YEAR = 1972, PAGES = {85--103}}

@InProceedings{KarpK00, AUTHOR = {Brad K. and Kung, H. T. }, TITLE = {{GPSR}: Greedy Perimeter Stateless Routing for Wireless

Networks},

BOOKTITLE = {Proceedings of the $6$th ACM Annual International Conference on Mobile Computing and Networking, MobiCom 2000},

YEAR = {2000}, ISBN = {1-58113-197-6}, PAGES = {243--254}, ADDRESS = {Boston, Massachusetts}, DOI = {http://doi.acm.org/10.1145/345910.345953}, PUBLISHER= {ACM}}

@Misc{Kathod04, AUTHOR = {Kathod, A.}, TITLE = {Questions on Wireless Security}, MONTH = {December}, YEAR = {2004}, NOTE = {http://www2.cio.com/ask/expert/2004/

questions/question1981.html}}

@Article{KellererVS02, AUTHOR = {Kellerer, W. and V\"{o}gel, H.-J. and Steinberg, K.-E.}, TITLE = {A Communication Gateway for Infrastructure Independent

$4${G} Wireless Access}, JOURNAL = {IEEE Communications Magazine}, YEAR = {2002}, VOLUME = {40}, NUMBER = {3}, PAGES = {126--131}, MONTH = {March}}

@TechReport{KhambattiA02, AUTHOR = {Khambatti, M. and Akkineni, S.}, TITLE = {Location Services in Wireless Ad Hoc and Hybrid Networks:

A Survey}, INSTITUTION = {Computer Science and Engineering Department, Arizona State

University}, YEAR = {2002}, ADDRESS = {Tempe, AZ}, MONTH = {May}}

@InProceedings{KimAK03, AUTHOR = {Kim, H. S. and Abdelzaher, T. F. and Kwon, W. H.},

TITLE = {Minimum Energy Asynchronous Dissemination to Mobile Sinks

in Wireless Sensor Networks}, BOOKTITLE = {Proceedings of the First ACM International Conference on

Embedded Networked Sensor Systems, SenSys 2003}, PAGES = {193--204}, YEAR = {2003}, ADDRESS = {Los Angeles, CA}, MONTH = {November, 5--7}}

@Article{KimAK05, AUTHOR = {Kim, H. S. and Abdelzaher, T. F. and Kwon, W. H.}, TITLE = {Dynamic Delay-Constrained Minimum-Energy Dissemination in

Wireless Sensor Networks}, JOURNAL = {ACM Transactions on Embedded Computing Systems}, YEAR = {2005}, VOLUME = {4}, NUMBER = {3}, PAGES = {679--706}, MONTH = {August}}

@InProceedings{KlaisingKN07, AUTHOR = {Klaising, R. and Kosowski, A. and Navarra, A.}, TITLE = {Cost Minimisation in Multi-interface Networks}, BOOKTITLE = {Proceedings of the $1$st EuroFGI International Conference

on Network Control and Optimization, NET-COOP 2007}, PAGES = {276--285}, SERIES = {LNCS 4465}, YEAR = 2007, ADDRESS = {Avignon, France}, MONTH = {June 5-7}}

@Article{Kleinrock96, AUTHOR = {Kleinrock, L.}, TITLE = {Nomadic Computing---An opportunity}, JOURNAL = {ACM SIGCOMM, Computer Communication Review}, VOLUME = 25, NUMBER = 1, PAGES = {36--40}, YEAR = 1996}

@InProceedings{KleinrockS78, AUTHOR = {Kleinrock, L. and Silvester, J.}, TITLE = {Optimum Transmission Radii for Packet Radio Networks or

Why Six is a Magic Number}, BOOKTITLE = {Proceedings of the IEEE 1978 National Telecommunications

Conference}, PAGES = {4.3/1--4.3/5}, ADDRESS = {Birmingham, AL}, MONTH = {3-6 December}, YEAR = 1978, ABSTRACT = {Studies the capacity of packet radio networks in which the

nodes are randomly located and which use slotted ALOHA as the access scheme, transporting messages through the network in a store and forward fashion. This random location of nodes can be thought of as representing either an arbitrary network or a snapshot of a mobile one (11 Refs.)}

}

@Book{Knuth97, AUTHOR = {Knuth, D. E.}, TITLE = {The Art of Computer Programming: Fundamental Algorithms}, EDITION = {third}, VOLUME = 1, PUBLISHER= {Addison Wesley}, ADDRESS = {Reading, MA}, YEAR = {1997}}

@Book{Knuth97a, AUTHOR = {Knuth, D. E.}, TITLE = {The Art of Computer Programming: Seminumerical

Algorithms}, EDITION = {third}, VOLUME = 2, PUBLISHER= {Addison Wesley}, ADDRESS = {Reading, MA}, YEAR = {1997}}

@Book{Knuth98, AUTHOR = {Knuth, D. E.}, TITLE = {The Art of Computer Programming: Sorting and Searching}, EDITION = {second}, VOLUME = 3, PUBLISHER= {Addison Wesley},

ADDRESS = {Reading, MA}, YEAR = {1998}}

@InProceedings{KodialamN03, AUTHOR = {Kodialam, M. and Nandagopal, T.}, TITLE = {Characterizing Achievable Rates in Multi-Hop Wireless

Multi-hop Networks: The Joint Routing and Scheduling Problem},

BOOKTITLE = {Proceedings of the $9$th Annual International Conference on Mobile Computing and Networking, ACM MobiCom 2003},


@Article{KodialamN05, AUTHOR = {Kodialam, M. and Nandagopal, T.}, TITLE = {Characterizing Achievable Rates in Multi-Hop Wireless Mesh

Networks with Orthogonal Channels}, JOURNAL = {IEEE/ACM Transactions on Networking}, YEAR = {2005}, VOLUME = {13}, NUMBER = {4}, PAGES = {868--880}, MONTH = {August}}

@InProceedings{KolinkoL07, AUTHOR = {Kolinko, P. and Larson, L. E.}, TITLE = {Passive {RF} Receiver Design for Wireless Sensor

Networks}, BOOKTITLE = {Proceeding of the IEEE/MTT-S International Microwave

Symposium, IMS 2007}, PAGES = {567-570}, YEAR = 2007, ADDRESS = {Honolulu, Hawaii}, MONTH = {June 3--8}}

@Article{KopfR87, AUTHOR = {Kopf, R. and Ruhe, G.}, TITLE = {A computational study of the weighted independent set

problem for general graphs}, JOURNAL = {Foundations of Control Engineering},

VOLUME = 12, NUMBER = 4, PAGES = {167--180}, YEAR = 1987, ABSTRACT = {The problem of determining the maximum weighted

independent set of a graph is considered. For this NP-hard problem six heuristics are developed and compared with an exact algorithm using branch-and-bound. The results of a computational study including 200 randomly generated examples are presented (13 Refs.)}

}

@InProceedings{KosowskiNP08, AUTHOR = {Kosowski, A. and Navarra, A. and Pinotti, M. C.}, TITLE = {Connectivity in Multi-interface Networks}, BOOKTITLE = {Proceedings of the $4$th International Symposium on

Trustworthy Global Computing,TGC 2008}, SERIES = {LNCS}, YEAR = 2008, ADDRESS = {Barcelona, Spain}, MONTH = {November 3-4}}

@InProceedings{KotayPR05, AUTHOR = {Kotay, K. and Peterson, R. and Rus, D.}, TITLE = {Experiments with Robots and Sensor Networks for Mapping

and Navigation}, BOOKTITLE = {Proceedings of the International Conference on Field and

Service Robotics, FSR 2005}, YEAR = {2005}, ADDRESS = {Port Douglas, Australia}, MONTH = {July 29--31}}

@InProceedings{KothandaramanVF02, AUTHOR = {Kothandaraman, P. and Valcarenghi, L. and Fumagalli, A.}, TITLE = {Generalized Stochastic Preplanned Restoration Scheme}, BOOKTITLE = {Proceedings of IEEE ETTC 2002}, YEAR = {2002}, ADDRESS = {Dallas, TX}, MONTH = {September, 23--24}}

@InProceedings{KoushanfarDNPS03, AUTHOR = {Koushanfar, F. and Davare, A. and Nguyen, D. T. and

Potkonjak, M. and Sangiovanni-Vincentelli, A.},

TITLE = {Low Power Coordination in Wireless Ad-Hoc Networks}, BOOKTITLE = {Proceedings of the 2003 International Symposium on Low

Power Electronics and Design, ISLPED 2003}, YEAR = {2003}, PAGES = {475--480}, ADDRESS = {Seoul, Korea}, MONTH = {August 25--27}}

@Article{KoV00, AUTHOR = {Ko, Y.-B. and Vaidya, N. H.}, TITLE = {Location-Aided Routing ({LAR}) in Mobile Ad Hoc Networks}, JOURNAL = {ACM/Kluwer Wireless Networks}, YEAR = {2000}, VOLUME = {6}, NUMBER = {4}, PAGES = {307--321}, MONTH = {July}}

@TechReport{KoV97, AUTHOR = {Ko, Y.-B. and Vaidya, N. H.}, TITLE = {Using Location Information to Improve Routing in Ad Hoc

Networks}, NUMBER = {97-013}, INSTITUTION = {Department of Comuter Science}, ADDRESS = {Texas A\&M University}, MONTH = {December}, YEAR = 1997}

@InProceedings{KoV98, AUTHOR = {Ko, Y.-B. and Vaidya, N. H.}, TITLE = {Location-Aided Routing ({LAR}) in Mobile Ad Hoc Networks}, BOOKTITLE = {Proceedings of the Fourth Annual ACM/IEEE International

Conference on Mobile Computing and Networking}, PAGES = {66--75}, ADDRESS = {Dallas, TX}, MONTH = {October 25--30}, YEAR = 1998}

@InProceedings{KozatKRM01, AUTHOR = {Kozat, U. C. and Kondylis, G. and Ryu, B. and Marina, M.

K.}, TITLE = {Virtual Dynamic Backbone for Mobile Ad Hoc Networks}, BOOKTITLE = {Proceedings of the IEEE International Conference on

Communications (ICC 2001)}, PAGES = {250--255}, YEAR = {2001}, VOLUME = {1}, ADDRESS = {Helsinki, Finland}, MONTH = {June 11--14}}

@Article{KrishnaVCP97, AUTHOR = {Krishna, P. and Vaidya, N. H. and Chatterjee, M. and

Pradhan, D. K.}, TITLE = {A Cluster-based Approach for Routing in Dynamic Networks}, JOURNAL = {ACM SIGCOMM Computer Communication Review}, YEAR = {1997}, VOLUME = {27}, NUMBER = {2}, PAGES = {49--64}, MONTH = {April}}

@InProceedings{KuhnW03, AUTHOR = {Kuhn, F. and Wattenhofer, R.}, TITLE = {Constant-Time Distributed Dominating Set Approximation}, BOOKTITLE = {Proceedings of the $22$nd ACM Symposium on Pronciple of

Distributed Computing (PODC 2003)}, PAGES = {25--32}, YEAR = {2003}, ADDRESS = {Boston, MA}, MONTH = {July 13--16}}

@InProceedings{KukshyaHT03, AUTHOR = {Kukshya, V. and Hsu, H. P. and Talty, T.}, TITLE = {Hardware Implementation Choices for Vehicular Telematics

Systems and Simulation Results}, BOOKTITLE = {Proceedings of the $58$th IEEE Vehicular Technology

Conference, VTC 2003 Fall}, PAGES = {3373--3376}, YEAR = {2003}, VOLUME = {5}, ADDRESS = {Orlando, FL}, MONTH = {October 6--9}}

@Article{KurkowskiCC05, AUTHOR = {Kurkowski, S. and Camp, T. and Colagrosso, M.}, TITLE = {{MANET} Simulation Studies: The Incredibles}, JOURNAL = {ACM/SIGMOBILE Mobile Computing and Communication Review,

MC$^2$R}, VOLUME = {9}, NUMBER = {4}, YEAR = {2005}, PAGES = {50--61}, PUBLISHER= {ACM Press}, ADDRESS = {New York, NY, USA}}

@InProceedings{KushilevitzM93, AUTHOR = {Kushilevitz, E. and Mansour, Y.}, TITLE = {An ${\Omega}({D}\log n/{D})$ Lower Bound for Broadcast in

Radio Networks}, BOOKTITLE = {Proceedings of the $12$th Annual ACM Symposium on

Principles of Distributed Computation}, ADDRESS = {Ithaca, New York}, PAGES = {65--74}, YEAR = 1993, ABSTRACT = {We show that for any randomized broadcast protocol for

radio networks, there exists a network in which the expected time to broadcast a message is Omega (Dlog(N/D)), where D is the diameter of the network and N is the number of nodes. This implies a tight lower bound of Omega (D log N) for all D<or=N/sup 1- epsilon / where epsilon >0 is any constant (12 Refs.)}

}

@Article{KushilevitzM98, AUTHOR = {Kushilevitz, E. and Mansour, Y.}, TITLE = {An ${\Omega}({D}\log n/{D})$ Lower Bound for Broadcast in

Radio Networks}, JOURNAL = {SIAM Journal on Computing}, VOLUME = 27, NUMBER = 3, PAGES = {702--712}, MONTH = {June}, YEAR = 1998, ABSTRACT = {As in the Conference Version}}

@InProceedings{KusySBLPTDP07,

AUTHOR = {Kus\'y, B. and Sallai, J. and Balogh, G. and L\'edeczi, {\'A} and Protopopesku, V. and Tolliver, J. and DeNap, F. and Parang, M.},

TITLE = {Radio Interferometric Tracking of Mobile Wireless Nodes}, BOOKTITLE = {Proceedings of ACM/USENIX MobiSys 2007}, PAGES = {139--151}, YEAR = {2007}, ADDRESS = {San Jose, PR}, MONTH = {June 11--14}}

@InProceedings{KwonG99, AUTHOR = {Kwon, T. J. and Gerla, M.}, TITLE = {Clustering with Power Control}, BOOKTITLE = {Proceedings of IEEE MILCOM 1999}, PAGES = {1424--1428}, YEAR = {1999}, VOLUME = {2}, ADDRESS = {Atlantic City, NJ}, MONTH = {November 1--3}}

@InProceedings{KyasanurV05, AUTHOR = {Kyasanur, P. and Vaidya, N. H.}, TITLE = {Capacity of Multi-Channel Wireless Networks: Impact on

Number of Channell and Interfaces}, BOOKTITLE = {Proceedings of the $11$th ACM Annual International



@InProceedings{LakshmananSTFPR02, AUTHOR = {Lakshmanan, S. and Shah, D. S. and Tacca, M and Fumagalli,

A. and Paradisi, A. and Rossi, S. M.}, TITLE = {An IP-Centric Control Plane for Survivable {WDM} Mesh

Networks: Experimental Results on the {OMEGA} Testbed}, BOOKTITLE = {Proceedings of the IEEE Workshop on IP Operations and

Management, IPOM 2002}, PAGES = {154--158}, YEAR = {2002}, ADDRESS = {Dallas, TX}, MONTH = {October 29--31}

}

@Article{LangelaarLB98, AUTHOR = {Langelaar, G. C. and Lagendijk, R. L. and Biemond J.}, TITLE = {Real-time labeling of {MPEG}-2 compressed video}, JOURNAL = {Journal of Visual Communication \& Image Representation}, VOLUME = 9, NUMBER = 4, PAGES = {256--270}, MONTH = {December}, YEAR = 1998, ABSTRACT = {Digital mass recording devices for video data will enter

the consumer market soon. Service providers are reluctant to offer services in digital form because of their fears for unrestricted duplication and dissemination. Therefore adequate copy protection systems should be developed, most likely based on labeling techniques. In this paper we propose two different techniques for the real-time labeling of digital video. Both methods embed the label information directly into an MPEG compressed video bitstream. The first method embeds the label by changing variable length codes in the bitstream. The second method discards some of the high frequency DCT-coefficients of the bitstream to embed the label. The first technique is computationally less expensive than the second one, however, the second one is more robust against attacks to remove the label. We show that the label can still be extracted after MPEG re-encoding at a lower bit-rate. (19 References).}

}

@InProceedings{Lauer86, AUTHOR = {Lauer, G. S.}, TITLE = {Hierarchical Routing Design for {SURAN}}, BOOKTITLE = {Proceedings of the IEEE International Conference on

Communications '86. ICC '86}, ADDRESS = {Toronto, Ont., Canada}, MONTH = {22-25 June}, YEAR = 1986, PAGES = {93--102}, VOLUME = {1}, ABSTRACT = {The author discusses issues that arise in the design of a

hierarchical routing protocol for a large mobile broadcast packet-switched network. The survivable packet radio network (SURAN) and the environment in which it is expected to work are described briefly. A set of requirements are derived that the routing algorithm must meet. Then some of

the hierarchical routing algorithms which have been proposed in the literature are considered and compared to the SURAN requirements. This comparison, based on both simulation and analytic results, is used to select an appropriate algorithm for initial implementation (21 Refs.)}

}

@InCollection{Lauer95, AUTHOR = {Lauer, G. S.}, TITLE = {Packet-Radio Routing}, BOOKTITLE = {Routing in Communication Networks}, EDITOR = {Steenstrup, M. E.}, PUBLISHER= {Prentice Hall}, ADDRESS = {Englewood Cliffs, NJ}, MONTH = {June}, PAGES = {351--396}, YEAR = 1995}

@InProceedings{LawMS01, AUTHOR = {Law, C. and Mehta, A. K. and Siu, K.-Y.}, TITLE = {Performance of a New {B}luetooth Scatternet Formation

Protocol}, BOOKTITLE = {Proceedings of the 2001 ACM International Symposium on

Mobile Ad Hoc Networking and Computing, MobiHoc 2001}, PAGES = {183--192}, ADDRESS = {Long Beach, CA}, MONTH = {4--5 October}, YEAR = 2001}

@Article{LawMS03, AUTHOR = {Law, C. and Mehta, A. K. and Siu, K.-Y.}, TITLE = {A New {B}luetooth Scatternet Formation Protocol}, JOURNAL = {ACM/Kluwer Journal on Mobile Networks and Applications

(MONET), Special Issue on Mobile Ad Hoc Networks (A.~Campbell, M.~Conti and S.~Giordano, eds.)},

PAGES = {485--498}, MONTH = {October}, YEAR = {2003}, VOLUME = 8, NUMBER = 5}

@InProceedings{LawrenceL04,

AUTHOR = {Lawrence, E. and Lawrence, J.}, TITLE = {Threats to the Mobile Enterprise: Jurisprudence Analysis

of Wardriving and Warchalking}, BOOKTITLE = {Proceedings of the IEEE International Conference on

Information Technology: Coding and Computing, ITCC 2004}, PAGES = {268--273}, YEAR = {2004}, VOLUME = {2}, ADDRESS = {Las Vegas, NV}, MONTH = {April 5--7}}

@InProceedings{LawS01, AUTHOR = {Law, C. and Siu, K.-Y.}, TITLE = {A {B}luetooth Scatternet Formation Algorithm}, BOOKTITLE = {Proceedings of the IEEE Globecom 2001}, ADDRESS = {San Antonio, TX}, MONTH = {25--29 November}, YEAR = 2001}

@InProceedings{LeeBA93, AUTHOR = {Lee, C. and Burns, J. E. and Ammar, M. H.}, TITLE = {Improved Randomized Broadcast Protocols in Multi-hop Radio

Networks}, BOOKTITLE = {Proceedings 1993 International Conference on Network

Protocols}, PAGES = {234--241}, ADDRESS = {San Francisco, CA}, MONTH = {19-22 October}, YEAR = 1993, ABSTRACT = {This paper presents a suite of randomized broadcast

protocols for the problem of broadcasting a message in multihop radio networks. The protocols are compared with the randomized broadcast protocol by R. Bar-Yehuda et al. (1989, 1991, 1992). The time complexity of one of the randomized broadcast protocols presented in this paper is shown, by simulation, to be much better than those of other protocols in most of the typical cases (9 Refs.)}

}

@Article{LeinerNT87, AUTHOR = {Leiner, B. M. and Nielson, D. L. and Tobagi, F. A.}, TITLE = {Issues in Packet Radio Network Design}, JOURNAL = {Proceedings of the IEEE. Special Issue on Packet Radio

Networks},

VOLUME = 75, NUMBER = 1, EDITOR = {Leiner, B. M. and Nielson, D. L. and Tobagi, F. A.}, PUBLISHER= {Proceedings of the IEEE}, PAGES = {6--20}, MONTH = {January}, YEAR = 1987, ABSTRACT = {A number of design issues and choices available are

outlined. The intent is to provide an overview of the design decisions that must be made so as to provide a context for the decisions made in a number of existing and developing packet radio networks. Three areas of design decisions are identified. The first deals with the physical aspects of the network and concentrates on the radio connectivity and channel sharing. The second deals with the automated management of the network and concentrates on issues such as link management and routing. The third deals with the interface of the network to the users and some practical aspects of operating and maintaining a network (27 Refs.)}

}

@InProceedings{LeThanhSM02, AUTHOR = {{Le Thanh}, S. and Schi{\o}ler, H. and Madsen, O. B.}, TITLE = {Hybrid Distributed Iterative Capacity Allocation over

{B}luetooth Network}, BOOKTITLE = {Proceedings of the $8$th International Conference on

Communication Systems, ICCS 2002}, PAGES = {583--588}, VOLUME = 1, YEAR = {2002}, ADDRESS = {Washington, DC}, MONTH = {November 25--28}}

@InProceedings{LevineAN95, AUTHOR = {Levine, D. A. and Akyildiz, I. F. and Naghshineh, M.}, TITLE = {The Shadow Cluster Concept for Resource Allocation and

Call Admission in ATM-Based Wireless Network}, BOOKTITLE = {Proceedings of The First Annual International Conference

on Mobile Computing and Networking, MobiCom 1995}, MONTH = {November 13--15}, ADDRESS = {Berkeley, CA}, YEAR = 1995, PAGES = {142--150}}

@InProceedings{LiangH00, AUTHOR = {Liang, B. and Haas, Z.}, TITLE = {Virtual Backbone Generation and Maintenance in Ad Hoc

Network Mobility Management}, BOOKTITLE = {Proceedings of the $19$th IEEE Infocom}, PAGES = {1293--1302}, YEAR = {2000}, VOLUME = {3}, ADDRESS = {Tel Aviv, Israel}, MONTH = {March 26--30}}

@Book{Lidl94, AUTHOR = {Lidl, R.}, TITLE = {Introduction to Finite Fields and Their Applications}, PUBLISHER= {Cambridge University Press}, YEAR = {1994}}

@InProceedings{LiHBWW01, AUTHOR = {Li, L. and Halpern, J. Y. and Bahl, P. and Wang, Y.-M.

Wattenhofer, R.}, TITLE = {Analysis of a cone-based distributed topology control

algorithm for wireless multi-hop networks}, BOOKTITLE = {Proceedings of the Twentieth Annual ACM Symposium on

Principles of Distributed Computing, PODC 2001}, YEAR = {2001}, PAGES = {264--273}, ADDRESS = {Newport, RI}, MONTH = {August, 26--29}}

@InProceedings{LiJCKM00, AUTHOR = {Li, J. and Jannotti, J. and {De Couto}, D. S. J. and

Karger, D. R. and Morris, R.}, TITLE = {A Scalable Location Service for Geographic Ad Hoc

Networks}, BOOKTITLE = {Proceedings of the $6$th ACM Annual International


PAGES = {120--130}, YEAR = {2000}, ADDRESS = {Boston, MA}, MONTH = {August 6--11}}

@InProceedings{LimK00, AUTHOR = {Lim, H. and Kim, C.}, TITLE = {Multicast Tree Construction and Flooding in Wireless Ad

Hoc Networks}, BOOKTITLE = {Proceedings of the $3$rd ACM International Workshop on

Modeling, Analysis and Simulation of Wireless and Mobile Systems, MSWiM 2000},

PAGES = {61--68}, YEAR = {2000}, ADDRESS = {Boston, MA}, MONTH = {August 11}}

@Book{LinC00, AUTHOR = {Lin, Y.-B. and Chlamtac, I.}, TITLE = {Wireless and Mobile Network Architectures}, PUBLISHER= {John Wiley \& Sons, Inc.}, ADDRESS = {Hoboken, NJ}, MONTH = {October}, YEAR = {2000}}

@InProceedings{LinCC06, AUTHOR = {Lin, C.-J. and Chou, P.-L. and Chou, C.-F.}, TITLE = {{HCDD}: Hierarchical Cluster-based Data Dissemination in

Wireless Sensor Networks with Mobile Sink}, BOOKTITLE = {Proceedings of the $2006$ International Conference on

Wireless Communications and Mobile Computing, IWCMC 2006}, PAGES = {1189--1194}, YEAR = {2006}, ADDRESS = {Vancouver, BC, Canada}, MONTH = {July 3--6}, DOI = {http://doi.acm.org/10.1145/1143549.1143787}, PUBLISHER= {ACM}}

@Book{Lindvall92, AUTHOR = {Lindvall, T.}, TITLE = {Lectures on the Coupling Method}, PUBLISHER= {John Wiley \& Sons, Inc.}, SERIES = {Wiley Series in Probability \& Mathematical

Statistics--Applied Probability \& Statistics Section}, ADDRESS = {Hoboken, NJ}, MONTH = {October}, YEAR = {1992}

}

@Article{LinG97, AUTHOR = {Lin, C. R. and Gerla, M.}, TITLE = {Adaptive Clustering for Mobile Wireless Networks}, JOURNAL = JSAC, VOLUME = 15, NUMBER = 7, PAGES = {1265--1275}, MONTH = {September}, YEAR = 1997}

@Article{LinG99, AUTHOR = {Lin, C. and Gerla, M.}, TITLE = {Real-Time Support in Multihop Wireless Networks}, JOURNAL = {ACM/Baltzer Wireless Networks}, YEAR = {1999}, VOLUME = {5}, NUMBER = {2}, PAGES = {125--135}}

@Misc{lingo, AUTHOR = {{Lindo Systems, Inc.}}, NOTE = {http://www.lindo.com}}

@InProceedings{Linial87, AUTHOR = {Linial, N.}, TITLE = {Distributive graph algorithms-global solutions from local

data}, BOOKTITLE = {Proceedings of the $28$th Annual Symposium on Foundations

of Computer Science}, ADDRESS = {Los Angeles, CA}, PAGES = {331--335}, MONTH = {12-14 October}, YEAR = 1987, ABSTRACT = {Processors that reside in the vertices of a graph G and

communicate only with their neighbors are considered. The system is synchronous and reliable, there is no limit on message lengths, and local computation is instantaneous. It is shown that a maximal independent set in an n-cycle cannot be found faster than Omega (log*n), and this is optimal. The d-regular tree of radius r cannot be colored with fewer than square root d colors in time 2r/3. If Delta

is the largest degree in G which has order n, then in time O(log*n) it can be colored with O( Delta /sup 2/) colors (12 Refs.)}

}

@Article{Linial92, AUTHOR = {Linial, N.}, TITLE = {Locality in Distributed Graph Algorithms}, JOURNAL = SIAMJC, VOLUME = 21, NUMBER = 1, MONTH = {February}, PAGES = {193--201}, YEAR = 1992, ABSTRACT = {This paper concerns a number of algorithmic problems on

graphs and how they may be solved in a distributed fashion. The computational model is such that each node of the graph is occupied by a processor which has its own ID. Processors are restricted to collecting data from others which are at a distance at most t away from them in t time units, but are otherwise computationally unbounded. This model focuses on the issue of locality in distributed processing, namely, to what extent a global solution to a computational problem can be obtained from locally available data. Three results are proved within this model: a 3-coloring of an n-cycle requires time Omega (log* n). This bound is tight, by previous work of Cole and Vishkin; any algorithm for coloring the d-regular tree of radius r which runs for time at most 2r/3 requires at least Omega ( square root d) colors. In an n-vertex graph of largest degree Delta , an O( Delta /sup 2/)-coloring may be found in time O(log* n) (12 Refs.)}

}

@Article{LinialS93, AUTHOR = {Linial, N. and Saks, M.}, TITLE = {Low Diameter Graph Decompositions}, JOURNAL = {Combinatorica}, VOLUME = 13, NUMBER = 4, PAGES = {441--454}, YEAR = 1993, ABSTRACT = {A decomposition of a graph G=(V,E) is a partition of the

vertex set into subsets (called blocks). The diameter of a decomposition is the least d such that any two vertices belonging to the same connected component of a block are at

distance <or=d. We prove (nearly best possible) statements of the form: Any n-vertex graph has a decomposition into a small number of blocks each having small diameter. Such decompositions provide a tool for efficiently decentralizing distributed computations. It was shown previously by A. Awerbuch et al (1990) that every graph has a decomposition into at most s(n) blocks of diameter at most s(n) for s(n)=n/sup O square root (loglogn/logn/). Using a technique of B. Awerbuch (1985) and B. Awerbuch and D. Peleg (1990), we improve this result by showing that every graph has a decomposition of diameter O(logn) into O(logn) blocks. In addition, we give a randomized distributed algorithm that produces such a decomposition and runs in time O(log/sup 2/n). The construction can be parameterized to provide decompositions that trade-off between the number of blocks and the diameter. We show that this trade-off is nearly best possible for two families of graphs: the first consists of skeletons of certain triangulations of a simplex and the second consists of grid graphs with added diagonals. The proofs in both cases rely on basic results in combinatorial topology, Sperner's lemma for the first class and Tucker's lemma for the second. (17 References).}

}

@InProceedings{LiR00, AUTHOR = {Li, Q. and Rus, D.}, TITLE = {Sending Messages to Mobile Users in Disconnected Ad-hoc

Wireless Networks}, BOOKTITLE = {Proceedings of $6$th ACM Annual International Conference

on Mobile Computing and Networking, MobiCom 2000}, PAGES = {44--55}, YEAR = {2000}, ADDRESS = {Boston, MA}, MONTH = {August 6--11}}

@InProceedings{LiS02, AUTHOR = {Li, X. and Stojmenovic, I.}, TITLE = {Partial {D}elaunay Triangulation and Degree-Limited

Localized {B}luetooth Scatternet Formation}, BOOKTITLE = {Proceedings of AD-HOC NetwOrks and Wireless, ADHOC-NOW

2002}, YEAR = {2002}, ADDRESS = {Fields Institute, Toronto, Canada},

MONTH = {September 20--21}}

@Article{LiuBC98, AUTHOR = {Liu, T. and Bahl, P. and Chlamtac, I.}, TITLE = {Mobility Modeling, Location Tracking and Trajectory

Prediction in Wireless {ATM} Networks}, JOURNAL = {IEEE Journal on Selected Areas in Communications}, VOLUME = 16, NUMBER = 6, MONTH = {August}, PAGES = {922--936}, YEAR = 1998}

@Misc{logicSupply, HOWPUBLISHED = {http://www.logicsupply.com}, YEAR = {2006}}

@Article{LoM87, AUTHOR = {Lo, W. F. and Mouftah, H. T.}, TITLE = {Collision detection and multitone tree search for

multiple-access protocols on radio channels}, JOURNAL = {IEEE Journal on Selected Areas in Communications}, VOLUME = {Sac-5}, NUMBER = 6, PAGES = {1035--1040}, MONTH = {July}, YEAR = 1987}

@Book{LovaszP86, AUTHOR = {Lov\'{a}sz, L. and Plummer, M. D.}, TITLE = {Matching Theory}, SERIES = {North Holland Mathematical Studies and number 29 in Annals

of Discrete Mathematics}, NUMBER = 121, PUBLISHER= {Elsevier Science and Akad\'{e}miai Kiad\'{o}}, ADDRESS = {The Netherlands and Budapest, Hungary}, YEAR = 1986}

@InProceedings{LuBH06, AUTHOR = {Lu, K. and Bolla, J. A. and Huynh, D. T.}, TITLE = {Adapting Connected {D}-Hop Dominating Sets to Topology

Changes in Wireless Ad Hoc Networks}, BOOKTITLE = {Proceedings of the $25$th IEEE International Performance,

Computing and Communications Conference, IPCCC 2006}, PAGES = {207--214}, YEAR = 2006, ADDRESS = {Phoenix, AZ}, MONTH = {April 10--12}}

@inproceedings{LuDSS09, author = {Lu, G. and De, D. and Xu, M. and Song, W.-Z. and Shirazi, B.}, title = {A Wake-on Sensor Network}, booktitle = {Proceedings of the $7$th ACM Conference on Embedded Networked Sensor Systems, SenSys 2009}, year = {2009}, pages = {341--342}, location = {Berkeley, California}, month ={November 4--6}}

@Article{Luby86, AUTHOR = {Luby, M.}, TITLE = {A simple parallel algorithm for the maximal independent

set problem}, JOURNAL = SIAMJC, VOLUME = 15, NUMBER = 4, PAGES = {1036--1053}, MONTH = {November}, YEAR = 1986, ABSTRACT = {Two basic design strategies are used to develop a very

simple and fast parallel algorithms for the maximal independent set (MIS) problem. The first strategy consists of assigning identical copies of a simple algorithm to small local portions of the problem input. The algorithm is designed so that when the copies are executed in parallel the correct problem output is produced very quickly. A very simple Monte Carlo algorithm for the MIS problem is presented which is based upon this strategy. The second strategy is a general and powerful technique for removing randomization from algorithms. This strategy is used to convert the Monte Carlo algorithm for this MIS problem into a simple deterministic algorithm with the same parallel running time (40 Refs.)}

}

@Article{LundgrenRBABHTJ06, AUTHOR = {Lundgren, H. and Ramachandran, K. and Belding-Royer, E. M.

and Almeroth, K. C. and Benny, M. and Hewatt, A. and Touma, A. and Jardosh, A.},

TITLE = {Experiences from the Design, Deployment, and Usage of the {UCSB} {MeshNet} Testbed},

JOURNAL = {IEEE Wireless Communications}, YEAR = {2006}, VOLUME = {13}, NUMBER = {2}, PAGES = {18--29}, MONTH = {April}}

@InProceedings{LuoH05, AUTHOR = {Luo, J. and Hubaux, J.-P.}, TITLE = {Joint Mobility and Routing for Lifetime Elongation in

Wireless Sensor Networks}, BOOKTITLE = {Proceedings of IEEE Infocom 2005}, VOLUME = {3}, PAGES = {1735--1746}, YEAR = {2005}, ADDRESS = {Miami, FL}, MONTH = {March 13--17}}

@Article{MackerC98, AUTHOR = {Macker, J. P. and Corson, M. S.}, TITLE = {Mobile Ad Hoc Networking and the {IETF}}, JOURNAL = {Mobile Computing and Communications Review, {MC\,$^{2}$R},

a publication of the ACM SIGMOBILE}, VOLUME = 2, NUMBER = 2, PAGES = {9-12}, MONTH = {April}, YEAR = 1998}

@InProceedings{MakS09, AUTHOR = {Mak, N. H and Seah, W. K. G.}, TITLE = {How Long is the Lifetime of a Wireless Sensor Network?}, BOOKTITLE = {Proceedings of the IEEE $23$rd International Conference on Advanced Information Networking and Applications, AINA 2009}, PAGES = {763--770}, YEAR = {2009},

ADDRESS = {Bradford, UK}, MONTH = {May 26--29}}

@Article{MakkiPF96, AUTHOR = {Makki, K. and Pissinou, N and Frieder, O.}, TITLE = {Efficient Solutions to Multicast Routing in Communication

Networks}, JOURNAL = {ACM/Baltzer Journal on Mobile Networks and Applications

(MONET)}, VOLUME = 1, NUMBER = 2, PAGES = {221--232}, YEAR = 1996}

@MastersThesis{Mambrini03, AUTHOR = {Mambrini, G.}, TITLE = {Confronto Prestazionale di Soluzioni di Scatternet

Formation in Reti {B}luetooth}, SCHOOL = {Dipartimento di Informatica, Universit\à di Roma ``La

Sapienza''}, YEAR = {2003}, ADDRESS = {Roma, Italy}, MONTH = {March}}

@TechReport{Manhattan, AUTHOR = {{European Telecommunications Standards Institute, ETSI}}, TITLE = {Selection Procedures for the Choice of Radio Transmission

Technologies of the {UMTS}}, INSTITUTION = {ETSI SMG-5}, YEAR = {1998}, NUMBER = {101 112 V3.2.0}, MONTH = {April}, ADDRESS = {Sophia Antipolis, France}}

@InProceedings{ManjeshwarA01, AUTHOR = {Manjeshwar, A. and Agrawal, D. P.}, TITLE = {{TEEN}: A Routing Protocol for Enhanced Efficiency in

Wireless Sensor Networks}, BOOKTITLE = {Proceedings of the $15$th International Parallel and

Distributed Processing Symposium {IPDPS 2001}}, PAGES = {2009--2015}, ADDRESS = {San Francisco, CA},

MONTH = {23--27 April}, YEAR = {2001}}

@InProceedings{ManjeshwarA02, AUTHOR = {Manjeshwar, A. and Agrawal, D. P.}, TITLE = {{APTEEN}: A Hybrid Protocol for Efficient Routing and

Comprehensive Information Retrieval in Wireless Sensor Networks},

BOOKTITLE = {Proceedings of the International Parallel and Distributed Processing Symposium {IPDPS} 2002},

PAGES = {195--202}, ADDRESS = {Ft.~Lauderdale, FL}, MONTH = {15--19 April}, YEAR = {2002}}

@Article{MaratheBHRR95, AUTHOR = {Marathe, M. V. and Breu, H. and {Hunt {III}}, H. B. and

Ravi, S. S. and Rosenkrantz, D. J.}, TITLE = {Simple Heuristics for Unit Graphs}, JOURNAL = {Networks}, YEAR = {1995}, VOLUME = {25}, NUMBER = {}, PAGES = {59--68}, MONTH = {}}

@TechReport{MarcucciNPV03, AUTHOR = {Marcucci, A. and Nati, M. and Petrioli, C. and Vitaletti,

A.}, TITLE = {Hierarchical Routing and Data Aggregation in Wireless

Sensor Networks}, INSTITUTION = {Universit\à di Roma ``La Sapienza''}, YEAR = {2003}, ADDRESS = {Roma, Italy}, MONTH = {October}}

@InProceedings{MarcucciNPV05, AUTHOR = {Marcucci, A. and Nati, M. and Petrioli, C. and Vitaletti,

A.}, TITLE = {Directed Diffusion Light: Low Overhead Data Dissemination

in Wireless Sensor Networks}, BOOKTITLE = {Proceedings of IEEE VTC 2005 Spring},

YEAR = {2005}, ADDRESS = {Stockholm, Sweden}, MONTH = {May 29-June 1}}

@InProceedings{MarotiVDKNLBM05, AUTHOR = {Mar\'oti, M. and V\"olgyesi, P. and D\'ora, S. and Kus\'y,

B. and N\'adas, A. and L\'edeczi, {\'A} and Balogh, G. and Moln\'ar, K.},

TITLE = {Radio Interferometric Geolocation}, BOOKTITLE = {Proceedings of ACM SenSys 2005}, PAGES = {1--12}, YEAR = 2005, ADDRESS = {San Diego, CA}, MONTH = {November 2--4}}

@InProceedings{MastrogiovanniPRVZ06, AUTHOR = {Mastrogiovanni, M. and Petrioli, C. and Rossi, M. and

Vitaletti, A. and Zorzi, M.}, TITLE = {Integrated Data Delivery and Interest Dissemination

Techniques for Wireless Sensor Networks}, BOOKTITLE = {Proceedings of the IEEE Global Telecommunication

Conference, Globecom 2006}, PAGES = {1--6}, YEAR = 2006, ADDRESS = {San Francisco, CA}, MONTH = {November 27--December 1}}

@Book{Matousek02, AUTHOR = {Matou\v{s}ek, J.}, TITLE = {Lectures on Discrete Geometry}, PUBLISHER= {Springer}, YEAR = 2002, VOLUME = 212, SERIES = {Graduate Text in Mathematics}, ADDRESS = {New York, NY}}

@Article{MauveWH01, AUTHOR = {Mauve, M. and Widmer, A. and Hartenstein, H.}, TITLE = {A survey on position-based routing in mobile ad hoc

networks}, JOURNAL = {IEEE Network}, VOLUME = 15,

NUMBER = 6, PAGES = {30--39}, MONTH = {November--December}, YEAR = 2001}

@Article{McaKayW90, AUTHOR = {McKay, B. D. and Wormand, N. C.}, TITLE = {Uniform Generation of Random Regular Graphs of Moderate

Degree}, JOURNAL = {Journal of Algorithms}, VOLUME = 11, NUMBER = 1, PAGES = {52--67}, MONTH = {March}, YEAR = 1990, ABSTRACT = { Shows how to generate k-regular graphs on n vertices

uniformly at random in expected time O(nk/sup 3/), provided k=O(n/sup 1/3/). The algorithm employs a modification of a switching argument previously used to count such graphs asymptotically for k=o(n/sup 1/3/). The asymptotic formula is re-derived, using the new switching argument. The method is applied also to graphs with given degree sequences, provided certain conditions are met. In particular, it applies if the maximum degree is O( mod E(G) mod /sup 1/4/). The method is also applied to bipartite graphs. (6 References).}

}

@Article{McDiarmid89, AUTHOR = {McDiarmid, C.}, TITLE = {On the Method of Boubded Differences}, JOURNAL = {Surveys in Combinatorics}, VOLUME = 141, PAGES = {148--188}, YEAR = 1989}

@Article{McDonaldZ99, AUTHOR = {McDonald, A. B. and Znati, T.}, TITLE = {A Mobility-Based Framework for Adaptive Clustering in

Wireless Ad Hoc Networks}, JOURNAL = {IEEE Journal on Selected Areas in Communications, Special

Issue on Wireless Ad Hoc Networks}, YEAR = {1999}, VOLUME = {17},

NUMBER = {8}, PAGES = {1466--1487}, MONTH = {August}}

@Book{MeesterR96, AUTHOR = {Meester, R. and Roy, R.}, TITLE = {Continuum Percolation}, PUBLISHER= {Cambridge University Press}, SERIES = {Cambridge Tracts in Mathematics}, ADDRESS = {Cambridge, UK}, MONTH = {June 13}, YEAR = {1996}}

@InProceedings{MengWXJLL07, AUTHOR = {Meng, M. and Wu, X. and Xu, H. and Jeong, B.-S. and Lee,

S. and Lee, Y.-K.}, TITLE = {Energy Efficient Routing in Multiple Sink Sensor

Networks}, BOOKTITLE = {Proceedings of the $15$th IEEE International Conference on

Computational Science and its Applications, ICCSA 2007}, PAGES = {561--566}, ADDRESS = {Kuala Lumpur, Malaysia}, MONTH = {August 26--29}, YEAR = {2007}}

@Article{MerlinS79, AUTHOR = {Merlin, P.M. and Segall, A.}, TITLE = {A Failsafe Distributed Routing Protocol}, JOURNAL = IEEETC, VOLUME = {Com-27}, NUMBER = 9, PAGES = {1280-1287}, MONTH = {September}, YEAR = 1979, ABSTRACT = {An algorithm for constructing and adaptively maintaining

routing tables in communication networks is presented. The algorithm can be employed in message as well as circuit switching networks, uses distributed computation, provides routing tables that are loop-free for each destination at all times, adapts to changes in network flows, and is completely failsafe. The latter means that after arbitrary failures and additions, the network recovers in finite time in the sense of providing routing paths between all

physically connected nodes. For each destination, the routes are independently updated by an update cycle triggered by the destination (12 Refs.)}

}

@InProceedings{MhatreR04, AUTHOR = {Mhatre, V. and Rosenberg, C.}, TITLE = {Homogeneous vs.\ Heterogeneous Clustered Sensor Networks:

A Comparative Study}, BOOKTITLE = {Proceedings of the 2004 IEEE International Conference on

Communications, ICC 2004}, PAGES = {3646--3651}, YEAR = {2004}, VOLUME = {6}, ADDRESS = {Paris, France}, MONTH = {June 20--24}}

@Article{MhatreR04a, AUTHOR = {Mhatre, V. and Rosenberg, C.}, TITLE = {Design Guidelines for Wireless Sensor Networks:

Communication, Clustering and Aggregation}, JOURNAL = {Ad Hoc Networks}, YEAR = {2004}, VOLUME = {2}, NUMBER = {1}, PAGES = {45--63}, MONTH = {January}}

@Article{MhatreRKMS05, AUTHOR = {Mhatre, V. P. and Rosenberg, C. and Kofman, D. and

Mazumdar, R. and Shroff, N.}, TITLE = {A Minimum Cost Heterogeneous Sensor Network with a

Lifetime Contraint}, JOURNAL = {IEEE Transactions on Mobile Computing}, YEAR = {2005}, VOLUME = {4}, NUMBER = {1}, PAGES = {4--15}, MONTH = {January/February}}

@Manual{MICAz05, TITLE = {{MICA}z Motes, Product Datasheet}, ORGANIZATION = {Crossbow Technology, Inc.},

ADDRESS = {San Jose, CA}, YEAR = {2005}, NOTE = {http://www.xbow.com/Products/Wireless\_Sensor\_Networks.htm}

}

@InProceedings{MikiKO96, AUTHOR = {Miki, T. and Kawahara, T. and Ohya, T.}, TITLE = {Revised Error Pattern Generation Program for Core

Experiment on Error Resilience}, BOOKTITLE = {ISO/IEC JTC1SC29/WG11 MPEG96/1492}, ADDRESS = {Maceio, Brazil}, MONTH = {November}, YEAR = 1996}

@InProceedings{MiklosRTVJ00, AUTHOR = {Mikl\'os, G. and R\'acz, A. and Turanyi, Z. and Valk\'o,

A. and Johansson, P.}, TITLE = {Performance Aspects of {B}luetooth Scatternet Formation}, BOOKTITLE = {Proceedings of ACM MobiHoc 2000}, ADDRESS = {Boston, MA}, MONTH = {August 11}, YEAR = 2000}

@Article{MillerTZ60, AUTHOR = {Miller, C. E. and Tucker, A. W. and R. A. Zemlin}, TITLE = {Integer Programming Formulation of Traveling Salesman

Problems}, JOURNAL = {Journal of the ACM}, YEAR = {1960}, VOLUME = {7}, NUMBER = {4}, PAGES = {311--325}, MONTH = {October}}

@InProceedings{MinC01, AUTHOR = {Min, R. and Chandrakasan, A.}, TITLE = {Energy-Efficient Communication for Ad-Hoc Wireless Sensor

Networks}, BOOKTITLE = {$35$th Asilomar Conference on Signals, Systems, and

Computers}, PAGES = {139--143},

VOLUME = {1}, ADDRESS = {Pacific Grove, CA}, MONTH = {November 4--7}, YEAR = {2001}}

@Article{MisicM03, AUTHOR = {Mi\v{s}i\'{c}, J. and Mi\v{s}i\'{c}, V. B.}, TITLE = {Bridges of {B}luetooth County: Topologies, Scheduling and

Performance}, JOURNAL = {IEEE Journal of Selected Areas in Communications, Wireless

Series. Special issue on Wireless LANs and Home Networks}, YEAR = {2003}, VOLUME = {21}, NUMBER = {2}, PAGES = {240--258}, MONTH = {February}}

@InCollection{MisicM05, AUTHOR = {Mi\v{s}i\'{c}, J. and Mi\v{s}i\'{c}, V. B.}, TITLE = {Intra-Piconet Polling Algorithms in{B}luetooth}, BOOKTITLE = {Handbook of Algorithms for Mobile and Wireless Networking

and Computing}, PUBLISHER= {Chapman and Hall/CRC Computer and Information Science}, YEAR = {2005}, EDITOR = {Boukerche, A.}, CHAPTER = {31}, PAGES = {725--734}, MONTH = {November 28}, ADDRESS = {Boca Raton, FL}}

@Book{MisicM06, AUTHOR = {Mi\v{s}i\'{c}, J. and Mi\v{s}i\'{c}, V. B.}, TITLE = {Performance Modeling and Analysis Of {B}luetooth Networks:

Polling, Scheduling, and Traffic Control}, PUBLISHER= {Auerbach Publications/CRC Press}, YEAR = {2006}, ADDRESS = {Boca Raton, FL}}

@Book{MisicM08, AUTHOR = {Mi\v{s}i\'{c}, J. and Mi\v{s}i\'{c}, V. B.}, TITLE = {Wireless Personal Area Networks: Performance,

Interconnection, and Security with IEEE 802.15.4},

PUBLISHER= {John Wiley and Sons, Ltd.}, YEAR = {2008}, SERIES = {Wireless Communications and Mobile Computing}, ADDRESS = {Chichester, West Sussex, England}}

@InProceedings{MiuBK05, AUTHOR = {Miu. A. and Balakrishnan, H. and Koskal, C. E.}, TITLE = {Improving Loss Resilience with Multi-Radio Diversity in

Wireless Networks}, BOOKTITLE = {Proceedings of the $11$th ACM Annual International



@Proceedings{MobiCom2000, KEY = {MobiCom2000}, TITLE = {MobiCom'2000 Proceedings of The Sixth Annual ACM/IEEE

In\-ter\-na\-tio\-nal Conference on Mobile Computing and Networking},

BOOKTITLE = {MobiCom 2000 Proceedings of The Sixth Annual ACM/IEEE In\-ter\-na\-tio\-nal Conference on Mobile Computing and Networking},

MONTH = {August 6--11}, ADDRESS = {Boston, MA}, YEAR = 2000}

@Proceedings{MobiCom95, KEY = {MobiCom'95}, TITLE = {MobiCom'95 Proceedings of The First Annual ACM/IEEE


BOOKTITLE = {MobiCom'95 Proceedings of The First Annual ACM/IEEE In\-ter\-na\-tio\-nal Conference on Mobile Computing and Networking},

MONTH = {November 13-15}, ADDRESS = {Berkeley, CA}, YEAR = 1995}

@Proceedings{MobiCom96,

KEY = {MobiCom'96}, TITLE = {MobiCom'96 Proceedings of The Second Annual ACM/IEEE


BOOKTITLE = {MobiCom'96 Proceedings of The Second Annual ACM/IEEE In\-ter\-na\-tio\-nal Conference on Mobile Computing and Networking},

MONTH = {November 10--12}, ADDRESS = {Rye, New York, NY}, YEAR = 1996}

@Proceedings{MobiCom97, KEY = {MobiCom'97}, TITLE = {MobiCom'97 Proceedings of The Third Annual ACM/IEEE


BOOKTITLE = {MobiCom'97 Proceedings of The Third Annual ACM/IEEE In\-ter\-na\-tio\-nal Conference on Mobile Computing and Networking},

MONTH = {September 26--30}, ADDRESS = {Budapest, Hungary}, YEAR = 1997}

@Proceedings{MobiCom99, KEY = {MobiCom'99}, TITLE = {MobiCom'99 Proceedings of The Fifth Annual ACM/IEEE


BOOKTITLE = {MobiCom'97 Proceedings of The Fifth Annual ACM/IEEE In\-ter\-na\-tio\-nal Conference on Mobile Computing and Networking},

MONTH = {August 15--20}, ADDRESS = {Seattle, WA}, YEAR = 1999}

@InProceedings{MolinsS06, AUTHOR = {Molins, M. and Stojanovic, M.}, TITLE = {Slotted {FAMA}: A {MAC} protocol for underwater acoustic

networks}, BOOKTITLE = {Proceedings of MTS/IEEE OCEANS 2006}, YEAR = {2006}}

@Article{MolloyRRW97, AUTHOR = {Molloy, M. S. O. and Robalewska, H. and Robinson, R. W.

and Wormand, N. C.}, TITLE = {1-Factorizations of Random Regular Graphs}, JOURNAL = {Random Structures \& Algorithms}, VOLUME = 10, NUMBER = 3, PAGES = {305--321}, MONTH = {May}, YEAR = 1997, ABSTRACT = { It is shown that for each r>or=3, a random r-regular

graph on 2n vertices is equivalent in a certain sense to a set of r randomly chosen disjoint perfect matchings of the 2n vertices, as n to infinity . This equivalence of two sequences of probabilistic spaces, called contiguity, occurs when all events almost sure in one sequence of spaces are almost sure in the other, and vice versa. The corresponding statement is also shown for bipartite graphs, and from this it is shown that a random r-regular simple digraph is almost surely strongly r-connected for all r>or=2. (14 References).}

}

@Misc{monarch, AUTHOR = {{The Rice University Monarch Project}}, TITLE = {Monarch Wireless Extension to the ns2 Simulator}, HOWPUBLISHED = {www.monarch.cs.rice.edu}, MONTH = {page accessed May 7}, YEAR = {2006}}

@Misc{Monolithics, TITLE = {{ASH} Transceiver Designer's Guide}, HOWPUBLISHED = {www.rfm.com}, MONTH = {May 19}, YEAR = {2004}}

@InProceedings{MontiFT02, AUTHOR = {Monti, P. and Fumagalli, A. and Tacca, M.}, TITLE = {A Differentiated Reliability {(DiR)} Approach for Dynamic

Provisioning in {WDM} Networks}, BOOKTITLE = {Proceedings of the $40$th Annual Allerton Conference on

Communication, Control and Computing}, YEAR = {2002}, ADDRESS = {Monticello, IL},

MONTH = {October}}

@InProceedings{MooreLRT04, AUTHOR = {Moore, D. and Leonard, J. and Rus, D. and Teller, S.}, TITLE = {Robust Distributed Network Localization with Noisy Range

Measurements}, BOOKTITLE = {Proceedings of the $2$nd ACM International Conference on

Embedded Networked Sensor Systems, ACM SenSys 2004}, PAGES = {50--61}, YEAR = {2004}, ADDRESS = {Baltimore, MD}, MONTH = {November 3--5}}

@Misc{Moteiv06, NOTE = {http://www.moteiv.com/}}

@InProceedings{MukarramAZ06, AUTHOR = {{Mukarram Bin Tariq}, M. and Ammar, M. H. and Zegura, E.

W.}, TITLE = {Message Ferry Route Design for Sparse Ad hoc Networks with

Mobile Nodes}, BOOKTITLE = {Proceedings of the $7$th ACM International Symposium on

Mobile Ad Hoc Networking and Computing, MobiHoc 2006}, PAGES = {37--48}, YEAR = {2006}, ADDRESS = {Firenze, Italy}, MONTH = {May 22--25}}

@Article{MurtyG96, AUTHOR = {Murthy, S. and {Garcia-Luna-Aceves}, J. J.}, TITLE = {An Efficient Routing Protocol for Wireless Networks}, JOURNAL = {ACM/Baltzer Journal on Mobile Networks and Applications,

{MANET}}, VOLUME = 1, NUMBER = 2, PAGES = {183--197}, MONTH = {October}, YEAR = 1996}

@Book{MusserDS01, AUTHOR = {Musser, D. R. and Derger, G. J. and Saini, A.},

TITLE = {{STL} Tutorial and Reference Guide}, PUBLISHER= {Addison Wesley}, ADDRESS = {Reading, MA}, EDITION = {second}, YEAR = 2001}

@InProceedings{NarayananFF02, AUTHOR = {Narayanan, K. R. and Fumagalli, A. and Fitchett, J.}, TITLE = {Efficient Tuning Strategies for the {LightRing}}, BOOKTITLE = {Proceedings of IEEE ETTC 2002}, YEAR = {2002}, ADDRESS = {Dallas, TX}, MONTH = {September, 23--24}}

@PhDThesis{Nati08, AUTHOR = {Nati, M.}, TITLE = {Geographic Routing: Mission Possible}, SCHOOL = {Universit\à di Roma ``La Sapienza''}, YEAR = 2008, ADDRESS = {Dipartimento di Informatica}, MONTH = {March}, NOTE = {Available at

http://www.di.uniroma1.it/eng/nati/phdThesisNati.pdf}}

@InProceedings{NavasI97, AUTHOR = {Navas, J. C. and Imielinski, T.}, TITLE = {Geo{C}ast---Geographic Addressing and Routing}, BOOKTITLE = {Proceedings of the The Third Annual ACM/IEEE International

Conference on Mobile Computing and Networking (MobiCom'97)},

PAGES = {66--76}, ADDRESS = {Budapest, Hungary}, MONTH = {26-30 September}, YEAR = 1997, ABSTRACT = {In the near future GPS will be widely used, thus allowing

a broad variety of location dependent services such as direction giving, navigation, etc. In this paper we propose and evaluate a routing and addressing method to integrate geographic coordinates into the Internet Protocol to enable the creation of location dependent services. The main challenge is to integrate the concept of physical location into the current design of the Internet which relies on logical addressing (9 Refs.)}

}

@Misc{navman, HOWPUBLISHED = {http://www.navman.com/land/products/eseries/}}

@Article{NelsonK84, AUTHOR = {Nelson, R. and Kleinrock, L.}, TITLE = {The Spatial Capacity of a Slotted ALOHA Multihop Packet

Radio Network with Capture}, JOURNAL = {IEEE Transactions on Communications}, VOLUME = {COM-32}, NUMBER = 6, PAGES = {684--694}, MONTH = {June}, YEAR = 1984, ABSTRACT = {A determination is made of throughput equations for a

packet radio network where terminals are randomly distributed on the plane, are able to capture transmitted signals, and use slotted ALOHA to access the channel. It is found that the throughput of the network is a strictly increasing function of the receiver's ability to capture signals, and depends on the transmission range of the terminals and their probability of transmitting packets. Under ideal circumstances, it is shown that the expected fraction of terminals in the network that are engaged in successful traffic in any slot does not exceed 21\% (18 Refs.)}

}

@Misc{netstumbler, HOWPUBLISHED = {http://www.netstumbler.com/}}

@InProceedings{NiebergHH04, AUTHOR = {Nieberg, T. and Havinga, P. and Hurink, J.}, TITLE = {Size-Controlled Dynamic Clustering in Mobile Wireless

Sensor Networks}, BOOKTITLE = {Proceedings of the 2004 Communication Networks and

Distributed Systems Modeling and Simulation Conference, (CSDN'04)},

PAGES = {}, YEAR = {2004}, ADDRESS = {San Diego, CA}, MONTH = {January 18--21}}

@InProceedings{NgSM08, AUTHOR = {Ng, H.-H. and Soh, W.-S. and Motani, M.}, TITLE = {{MACA-U}: A Media Access Protocol for Underwater Acoustic Networks}, BOOKTITLE = {Proceedings of IEEE Globecom 2008}, PAGES = {1--5}, ADDRESS = {New Orleans, LA}, MONTH = {November 30--December 4}, YEAR = 2008}

@Book{ns2, AUTHOR = {{The VINT Project}}, TITLE = {The ns Manual}, PUBLISHER= {http://www.isi.edu/nsnam/ns/}, YEAR = 2002}

@InProceedings{NiTCS99, AUTHOR = {Ni, S.-Y. and Tseng, Y.-C. and Chen, Y.-S. and Sheu,

J.-P.}, TITLE = {The Broadcast Storm Problem in a Mobile Ad Hoc Network}, BOOKTITLE = {Proceedings of the Fifth Annual ACM/IEEE International

Conference on Mobile Computing and Networking, MobiCom '99},

PAGES = {151--162}, ADDRESS = {Seattle, WA}, MONTH = {15--20 August}, YEAR = 1999}

@Misc{nyt-wsec04, TITLE = {{STANDARDS AND PRACTICES}; To Be Safer, Turn On the Security}, HOWPUBLISHED = {http://select.nytimes.com/gst/abstract.html?res=F00B13F93F590C778CDDAC0894DC404482}, YEAR = {2004}}

@Book{Ore63, AUTHOR = {Ore, O.}, TITLE = {Graphs and Their Uses}, SERIES = {New Mathematical Library}, PUBLISHER= {Random House and The L.\ W.\ Singer Company}, ADDRESS = {New York, NY},

YEAR = 1963}

@InProceedings{OrecchiaPPV04, AUTHOR = {Orecchia, L. and Panconesi, A. and Petrioli, C. and

Vitaletti, A.}, TITLE = {Localized Techniques for Broadcasting in Wireless Sensor

Networks}, BOOKTITLE = {Proceeding of the ACM Joint Workshop on the Foundation of

Mobile Computing, Dial M-POMC 2004}, YEAR = {2004}, ADDRESS = {Philadelphia, PA}, MONTH = {October 1}}

@InProceedings{OymanE04, AUTHOR = {Oyman, I. E. and Ersoy, C.}, TITLE = {Multiple Sink Network Design Problem in Large Scale

Wireless Sensor Networks}, BOOKTITLE = {Proceeding of the IEEE International Conference on

Communications, ICC 2004}, YEAR = {2004}, VOLUME = 6, PAGES = {3663--3667}, ADDRESS = {Paris, France}, MONTH = {June 20--24}}

@InProceedings{PaganiR97, AUTHOR = {Pagani, E. and Rossi, G. P.}, TITLE = {Reliable Broadcast in Mobile Multi Hop Packet Networks}, BOOKTITLE = {Proceedings of the The Third Annual ACM/IEEE International

Conference on Mobile Computing and Networking (MobiCom'97)},

PAGES = {34--42}, ADDRESS = {Budapest, Hungary}, MONTH = {26--30 September}, YEAR = 1997}

@Book{Palmer85, AUTHOR = {Palmer, E. M.}, TITLE = {Graphical Evolutions: An Introduction to the Theory of

Random Graphs}, SERIES = {Wiley-Interscience Series in Discrete Mathematics}, PUBLISHER= {John Wiley \& Sons},

ADDRESS = {New York, NY}, YEAR = 1985}

@Book{Papadimitriou94, AUTHOR = {Papadimitriou, C. H.}, TITLE = {Computational Complexity}, PUBLISHER= {Addison-Wesley}, ADDRESS = {Reading, MA}, YEAR = 1994}

@InProceedings{PapadimitriouG05, AUTHOR = {Papadimitriou, I. and Georgiadis, L.}, TITLE = {Maximum Lifetime Routing to Mobile Sink in Wireless Sensor

Networks}, BOOKTITLE = {Proceedings of the 2005 International Conference on

Software, Telecommunications and Computer Networks, SoftCOM 2005},

YEAR = {2005}, ADDRESS = {Split, Croatia}, MONTH = {September 15--17}}

@InProceedings{Parekh94, AUTHOR = {Parekh, A. K.}, TITLE = {Selecting Routers in Ad Hoc Wireless Networks}, BOOKTITLE = {Proceedings of the SBT/IEEE International

Telecommunications Symposium, ITS 1994}, PAGES = {420--424}, YEAR = {1994}, ADDRESS = {Rio de Janeiro, Brasil}, MONTH = {August 22-25}}

@InProceedings{ParkC97, AUTHOR = {Park, V. and Corson, M. S.}, TITLE = {A Highly Adaptive Distributed Algorithm for Mobile

Wireless Networks}, BOOKTITLE = {Proceedings of the IEEE INFOCOM'97}, ADDRESS = {Kobe, Japan}, MONTH = {7--11 April}, YEAR = 1997}

@Article{ParkSAH07,

AUTHOR = {Park, S. and Shin, K. and Abraham, A. and Han, S.}, TITLE = {Optimized Self Organized Sensor Networks}, JOURNAL = {Sensors}, YEAR = 2007, VOLUME = 7, PAGES = {730--742}}

@InProceedings{PatersonY92, AUTHOR = {Paterson, M. S. and Yao, P. P.}, TITLE = {On Nearest-Neighbor Graphs}, BOOKTITLE = {Proceedings of the $19$th International Colloquium on

Automata, Languages and Programming, ICALP 1992}, SERIES = {LNCS 623}, PAGES = {416--426}, YEAR = {1992}, ADDRESS = {Vienna, Austria}, MONTH = {July 13--17}}

@Book{Pedoe95, AUTHOR = {Pedoe, D.}, TITLE = {Circles: A Mathematical View}, EDITION = {revised}, PUBLISHER= {Math. Ass. Amer.}, ADDRESS = {Washington, DC}, YEAR = 1995}

@InProceedings{PengL00, AUTHOR = {Peng, W. and Lu, X.-C.}, TITLE = {On the Reduction of Broadcast Redundancy in Mobile Ad Hoc

Networks}, BOOKTITLE = {Proceedings of the $1$st ACM International Symposium on

Mobile Ad Hoc Networking and Computing, MobiHoc 2000}, PAGES = {129--130}, YEAR = {2000}, ADDRESS = {Boston, MA}, MONTH = {August 11}}

@Book{Penrose03, AUTHOR = {Penrose, M. D.}, TITLE = {Random Geometric Graphs}, PUBLISHER= {Oxford University Press}, SERIES = {Oxford Studies in Probability, 5},

ADDRESS = {New York, NY}, MONTH = {June 1}, YEAR = {2003}}

@Article{Penrose99, AUTHOR = {Penrose, M. D.}, TITLE = {On $k$-connectivity for a Geometric Random Graph}, JOURNAL = {Random Structures and Algorithms}, YEAR = {1999}, VOLUME = {15}, NUMBER = {2}, PAGES = {145--164}, MONTH = {September}}

@Book{Perkins01, EDITOR = {Perkins, C. E.}, TITLE = {Ad Hoc Networking}, PUBLISHER= {Addison Wesley}, YEAR = 2001, ADDRESS = {Boston}}

@Article{Perkins97, AUTHOR = {Perkins, C.}, TITLE = {Mobile {IP}}, JOURNAL = {IEEE Communications Magazine}, EDITOR = {Krishna, A.}, VOLUME = 35, NUMBER = 5, PAGES = {84--99}, MONTH = {May}, YEAR = 1997}

@Misc{Perkins98, AUTHOR = {Perkins, C. E.}, TITLE = {Ad Hoc On-Demand Distance Vector (AODV) Routing}, HOWPUBLISHED = {INTERNET DRAFT---Mobile Ad hoc NETworking ({MANET})

Working Group of the Internet Engineering Task Force ({IETF})},

MONTH = {August 10}, YEAR = 1998, NOTE = {To be considered Work in Progress.\ See also

\cite{MackerC98}}}

@Misc{PerkinsBD03, AUTHOR = {Perkins, C. E. and Belding-Royer, E. M. and Das, S. R.}, TITLE = {Ad Hoc On-Demand Distance Vector ({AODV}) Routing}, HOWPUBLISHED = {Request for Comments: 3561---Mobile Ad hoc NETworking ({MANET}) Working Group of the Internet Engineering Task Force ({IETF})}, MONTH = {July}, YEAR = 2003}

@Book{Perkins98b, AUTHOR = {Perkins, C. E.}, TITLE = {Mobile {IP}, Design Principles and Practices}, PUBLISHER= {Prentice Hall PTR}, YEAR = 1998, ADDRESS = {Upper Saddle River, NJ}, MONTH = {January 15}}

@Article{PerkinsB94, AUTHOR = {Perkins, C. E. and Bhagwat, P.}, TITLE = {Highly dynamic destination-sequenced distance-vector

routing ({DSDV}) for mobile computers}, JOURNAL = {Computer Communication Review}, VOLUME = 24, NUMBER = 4, PAGES = {234-244}, MONTH = {October}, YEAR = 1994}

@Article{PerkinsH97, AUTHOR = {Perkins, C. and Harjono, H.}, TITLE = {Resource Discovery Protocol for Mobile Computing}, JOURNAL = {Mobile Networks and Applications (MONET), special issue on Mobile Computing and System Services}, EDITOR = {Krishna, A.}, VOLUME = 1, NUMBER = 4, PAGES = {447--455}, MONTH = {January}, YEAR = 1997}

@InProceedings{PerkinsR99, AUTHOR = {Perkins, C. E. and Royer, E. M.}, TITLE = {Ad Hoc On-Demand Distance Vector Routing}, BOOKTITLE = {Proceedings of the $2$nd IEEE Workshop on Mobile Computing Systems and Applications, WMCSA 1999}, PAGES = {90--100}, YEAR = {1999}, ADDRESS = {New Orleans, LA}, MONTH = {February 25--26}}

@Article{PhilipGQ05, AUTHOR = {Philip, S. J. and Ghosh, J. and Qiao, C.}, TITLE = {Performance Evaluation of A Hierarchical Location

ManagementProtocol for Ad hoc Networks}, JOURNAL = {Computer Communications, Special issue on Performance

Issues of Wireless LANs, PANs, and Ad Hoc Networks}, EDITOR = {}, VOLUME = 8, NUMBER = 10, PAGES = {1110--1122}, MONTH = {}, YEAR = 2005}

@InProceedings{PolastreSC05, AUTHOR = {Polastre, J. and Szewczyk, R. and Culler, D.}, TITLE = {Telos: Enabling Ultra-Low Power Wireless Research}, BOOKTITLE = {Proceedings of the $4$th International Symposium on

Information Processing in Sensor Networks, IPSN 2005}, YEAR = {2005}, PAGES = {364--369}, ADDRESS = {Los Angeles, CA}, MONTH = {April 25--27}}

@Article{Polsani03, AUTHOR = {Polsani, P. R.}, TITLE = {Use and Abuse of Reusable Learning Objects}, JOURNAL = {Journal of Digital Information}, YEAR = {2003}, VOLUME = {3}, NUMBER = {4}}

@InProceedings{PompiliMA06,

AUTHOR = {Pompili, D. and Melodia, T. and Akyildiz, I. F.}, TITLE = {Routing algorithms for delay-insensitive and

delay-sensitive applications in underwater sensor networks},

BOOKTITLE = {Proceedings of ACM MobiCom 2006}, PAGES = {298--309}, YEAR = {2006}, MONTH = {September 24--29}, ADDRESS = {Los Angeles, CA}}

@Book{PooleMG98, AUTHOR = {Poole, D. and Mackworth, A. and Goebel, R.}, TITLE = {Computational Intelligence: A Logical Approach}, PUBLISHER= {Oxford University Press, Inc.}, ADDRESS = {New York, NY}, YEAR = 1998}

@Book{PreparataS85, AUTHOR = {Preparata, F. P. and Shamos, M. I.}, TITLE = {Computational Geometry: An Introduction}, PUBLISHER= {Springer-Verlag}, YEAR = {1985}, SERIES = {Text and Monographs in Computer Science}}

@InProceedings{PriyanthaCB00, AUTHOR = {Priyantha, N. B. and Chakraborty, A. and Balakrishnan,

H.}, TITLE = {The {C}ricket Location-Support System}, BOOKTITLE = {Proceedings of the $6$th Annual International Conference

on Mobile Computing and Networking, MobiCom 2000}, YEAR = {2000}, PAGES = {32--43}, ADDRESS = {Boston, MA}}

@InProceedings{PuccinelliBH07, AUTHOR = {Puccinelli, D. and Brennan, M. and Haenggi, M.}, TITLE = {Reactive Sink Mobility in Wireless Sensor Networks}, BOOKTITLE = {Proceedings of ACM MobiOpp 2007}, PAGES = {25--32}, YEAR = {2007}, ADDRESS = {San Juan, PR}, MONTH = {June 11}

}

@InProceedings{QayyumVL02, AUTHOR = {Qayyum, A. and Viennot, L. and Laouiti, A.}, TITLE = {Multipoint Relaying for Flooding Broadcast Messages in

Mobile Wireless Networks}, BOOKTITLE = {Proceedings of the $35$th Annual Hawaii International

Conference on System Science, HICSS 2002}, PAGES = {3866--3875}, YEAR = {2002}, ADDRESS = {Big Island, Hawaii}, MONTH = {January 7--10}}

@Article{RajagopalanV98, AUTHOR = {Rajagopalan, S. and Vazirani, V. V.}, TITLE = {Primal-Dual {RNC} Approximation Algorithms for Set Cover

and Covering Integer Programs}, JOURNAL = SIAMJC, VOLUME = 28, NUMBER = 2, PAGES = {525--540}, YEAR = 1998}

@InProceedings{RamachandranBAB06, AUTHOR = {Ramachandran, K. N. and Belding-Royer, E. M. and Almeroth,

K. C. and Buddhikot, M. M.}, TITLE = {Interference-Aware Channel Assignment in Multi-Radio

Wireless Mesh Networks}, BOOKTITLE = {Proceedings of IEEE Infocom 2006}, YEAR = {2006}, ADDRESS = {Barcelona, Spain}, MONTH = {April 23--29}}

@InProceedings{Ramanathan99, AUTHOR = {{GTE~Internetworking~-~BBN~Technologies}}, TITLE = {Den\-si\-ty- and Asymmetry-Adaptive Wireless Network

({DAWN})}, BOOKTITLE = {http://www.net-tech.bbn. com/dawn/dawn-index.html. {\em

See also}}, YEAR = 1999, CROSSREF = {GloMo99}}

@Article{RamanathanS98, AUTHOR = {Ramanathan, R. and Steenstrup, M.}, TITLE = {Hierarchically-Organized, Multihop Mobile Wireless

Networks for Quality-of-service Support}, JOURNAL = {Mobile Networks \& Applications}, VOLUME = 3, NUMBER = 1, PAGES = {101--119}, MONTH = {June}, YEAR = 1998, ABSTRACT = {MMWN is a modular system of adaptive link- and

network-layer algorithms that provides a foundation on which to build mechanisms for quality-of-service provision in large, multihop mobile wireless networks. Such networks are a practical means for creating a communications infrastructure where none yet exists or where the previously existing infrastructure has been severely damaged. These networks provide communications for such diverse purposes as tactical maneuvering and strategic planning on the battlefield, emergency relief in an area afflicted by a natural disaster, and field studies conducted by a team of scientists in a remote location. We describe three key components of the MMWN system: the clustering procedures for defining a virtual, hierarchical control structure superimposed on a large network of mobile switches and endpoints; the location management procedures for determining the current locations of mobile endpoints relative to the hierarchical control structure; and the virtual circuit management procedures for setting up and repairing virtual circuits as switches and endpoints move. We also provide simulation results that illustrate the robustness of each of these components with respect to a broad spectrum of transmission ranges and relative mobility of switches and endpoints. (35 References).}

}

@Article{RaoK04, AUTHOR = {Rao, R. and Kesidis, G.}, TITLE = {Purposeful Mobility for Relaying and Surveillance in

Mobile Ad Hoc Sensor Networks}, JOURNAL = {IEEE Transactions on Mobile Computing}, YEAR = {2004}, VOLUME = {3}, NUMBER = {3}, PAGES = {225--232}, MONTH = {July--September}

}

@InProceedings{RaoPSS03, AUTHOR = {Rao, A. and Papadimitriou, C. and Shenker, S. and Stoica,

I.}, TITLE = {Geographic Routing Without Location Information}, BOOKTITLE = {Proceedings of the $9$th ACM Annual International


PLACE = {San Diego, CA}, MONTH = {September 14--19}, YEAR = {2003}, PAGES = {96--108}, ADDRESS = {San Diego, CA}}

@Article{RatnasamyKSEGYY03, AUTHOR = {Ratnasamy, S. and Karp, B. and Shenker, S. and Estrin, D.

and Govindan, R. and Yin, L. and Yu, F.}, TITLE = {Data-centric Storage in Sensornets with {GHT}, a

Geographic Hash Table}, JOURNAL = {ACM/Kluwer Mobile Networks and Applications}, YEAR = 2003, VOLUME = 8, NUMBER = 4, PAGES = {427-442}, MONTH = {August}}

@InProceedings{RenMC06, AUTHOR = {Ren, B. and Ma, J. and Chen, C.}, TITLE = {The Hybrid Mobile Wireless Sensor Networks for Data

Gathering}, BOOKTITLE = {Proceedings of the ACM International Conference on

Wireless Communications and Mobile Computing, IWCMC 2006}, YEAR = {2006}, PAGES = {1085--1090}, ADDRESS = {Vancouver, BC, Canada}, MONTH = {July 3--6}}

@InProceedings{RodopluP05, AUTHOR = {Rodoplu, V. and Park, M.}, TITLE = {An energy-efficient {MAC} protocol for underwater wireless

acoustic networks}, BOOKTITLE = {Proceedings of MTS/IEEE OCEANS 2005},

YEAR = {2005}}

@Book{Ross96, AUTHOR = {Ross, M. S.}, TITLE = {Stochastic Processes}, PUBLISHER= {Wiley}, YEAR = {1996}, ADDRESS = {New York}, EDITION = {second}, MONTH = {April}}

@Article{RossiZR08, AUTHOR = {Rossi, M. and Zorzi, M. and Rao, R. R.}, TITLE = {Statistically Assisted Routing Algorithms ({SARA}) for Hop

Count-based Forwarding in Wireless Sensor Networks}, JOURNAL = {ACM/Elsevier Wireless Networks}, YEAR = {2008}, VOLUME = {14}, NUMBER = {1}, PAGES = {55--70}, MONTH = {January}}

@InProceedings{RoyerP99, AUTHOR = {Royer, E. M. and Perkins, C. E.}, TITLE = {Multicast Using Ad-hoc On-Demand Distance Vector Routing}, BOOKTITLE = {Proceedings of the Fifth Annual ACM/IEEE International

Conference on Mobile Computing and Networking, MobiCom'99}, PAGES = {207--218}, ADDRESS = {Seattle, WA}, MONTH = {15--20 August}, YEAR = 1999}

@Article{RoyerT99, AUTHOR = {Royer, E. M. and Toh, C.-K.}, TITLE = {A Review of Current Routing Protocols for Ad Hoc Mobile

Wireless Networks}, JOURNAL = {IEEE Personal Communications}, VOLUME = 6, NUMBER = 2, PAGES = {46--55}, MONTH = {April},

YEAR = 1999}

@InProceedings{RyuSC01a, AUTHOR = {Ryu, J. H. and Song, S. and Cho, D. H.}, TITLE = {New clustering schemes for energy conservation in

two-tiered mobile ad hoc networks}, BOOKTITLE = {Proceedings of IEEE ICC 2001}, PAGES = {862--866}, YEAR = {2001}, VOLUME = {3}, ADDRESS = {Helsinki, Finland}, MONTH = {June 11--15}}

@Article{RyuSC01b, AUTHOR = {Ryu, J. H. and Song, S. and Cho, D. H.}, TITLE = {Energy-conserving clustering scheme for multicasting in

two-tier mobile ad hoc networks}, JOURNAL = {Electronic Letters}, YEAR = {2001}, VOLUME = {37}, NUMBER = {20}, PAGES = {1253--1255}, MONTH = {September}}

@Article{RyuSC01c, AUTHOR = {Ryu, J. H. and Song, S. and Cho, D. H.}, TITLE = {Clustering scheme for energy conservation in two-tiered

mobile ad hoc networks}, JOURNAL = {Electronic Letters}, YEAR = {2001}, VOLUME = {37}, NUMBER = {11}, PAGES = {710--711}, MONTH = {May}}

@InProceedings{SalonidisBT00, AUTHOR = {Salonidis, T. and Bhagwat, P. and Tassiulas, L.}, TITLE = {Proximity Awareness and Fast Connection Establishment in

{B}luetooth}, BOOKTITLE = {Proceedings of the First Annual Workshop on Mobile and Ad

Hoc Netowrking and Computing}, PAGES = {141--142},

YEAR = 2001}

@InProceedings{SalonidisBTL01, AUTHOR = {Salonidis, T. and Bhagwat, P. and Tassiulas, L. and

LaMaire, R.}, TITLE = {Distributed Topology Construction of {B}luetooth Personal

Area Networks}, BOOKTITLE = {Proceedings of the IEEE Infocom 2001}, PAGES = {1577--1586}, ADDRESS = {Anchorage, AK}, MONTH = {April 22--26}, YEAR = 2001}

@Book{Samama08, AUTHOR = {Samama, N.}, TITLE = {Global Positioning: Technologies and Performance}, SERIES = {Wiley Survival Guides in Engineering and Science}, PUBLISHER= {Wiley and Sons, Inc.}, ADDRESS = {Hoboken, NJ}, YEAR = {2008}}

@InProceedings{SanchezEM99, AUTHOR = {S\'anchez, R. and Evans, J. and Minden, G.}, TITLE = {Networking on the Battlefield: Challenges in Highly

Dynamic Multi-hop Wireless Networks}, BOOKTITLE = {Proceedings of the IEEE Military Communications

Conference, MILCOM'99}, PAGES = {751--755}, YEAR = {1999}, VOLUME = {2}, ADDRESS = {Atlantic City, NJ}, MONTH = {October 31--November 3}}

@Book{Santi05, AUTHOR = {Santi, P.}, TITLE = {Topology Control in Wireless Ad Hoc and Sensor Networks}, PUBLISHER= {John Wiley and Sons, Ltd.}, YEAR = {2005}, ADDRESS = {Chichester, West Sussex, England}, MONTH = {May}}

@InProceedings{SantiS04, AUTHOR = {Santi, P. and Simon, J.}, TITLE = {Silence is Golden with High Probability: Maintaining a

Connected Backbone in Wireless Sensor Networks}, BOOKTITLE = {Proceedings of the $1$st IEEE European Workshop on

Wireless Sensor Networks, EWSN 2004}, EDITOR = {Karl, H. and Willig, A. and Wolisz, A.}, PAGES = {106--212}, YEAR = {2004}, NUMBER = {2920}, SERIES = {LNCS}, ADDRESS = {Berlin, Germany}, MONTH = {January 19--21}}

@InProceedings{SavvidesHS01, AUTHOR = {Savvides, A. and Han, C.-C. and Srivastava, M. B.}, TITLE = {Dynamic Fine-Grained Localization in Ad-Hoc Networks of

Sensors}, BOOKTITLE = {Proceedings of the Seventh ACM Annual Conference on Mobile

Computing and Networking}, PAGES = {166--179}, YEAR = {2001}, ADDRESS = {Rome, Italy}, MONTH = {July 16--21}}

@InCollection{SavvidesS04, AUTHOR = {Savvides, A. and Srivastava, M. B.}, TITLE = {Location Discovery}, BOOKTITLE = {Mobile Ad Hoc Networking}, PAGES = {231--254}, PUBLISHER= {IEEE Press and John Wiley and Sons, Inc.}, YEAR = {2004}, EDITOR = {Basagni, S. and Conti, M. and Giordano, S. and

Stojmenovic, I.}, CHAPTER = {8}, ADDRESS = {Piscataway, NJ and New York, NY}, MONTH = {April}}

@InProceedings{SchurgersS01, AUTHOR = {Schurgers, C. and Srivastava, M. B.}, TITLE = {Energy Efficient Routing in Wireless Sensor Networks}, BOOKTITLE = {Proceedings of IEEE MILCOM 2001},

PAGES = {357--361}, YEAR = {2001}, ADDRESS = {Vienna, VA}, MONTH = {October 28--31}}

@Article{SchurgersTGS02, AUTHOR = {Schurgers, C. and Tsiatsis, V. and Ganeriwal, S. and

Srivastava, M. B.}, TITLE = {Optimizing Sensor Networks in the Energy-Latency-Density

Design Space}, JOURNAL = {IEEE Transactions on Mobile Computing}, YEAR = {2002}, VOLUME = {1}, NUMBER = {1}, PAGES = {70--80}, MONTH = {January-March}}

@InProceedings{SchurgersTS02, AUTHOR = {Schurgers, C. and Tsiatsis, V. and Srivastava, M. B.}, TITLE = {{STEM}: Topology Management for Energy Efficient Sensor

Networks}, BOOKTITLE = {Proceedings of the IEEE Aerospace Conference 2002}, PAGES = {1099-1108}, YEAR = {2002}, VOLUME = {3}, ADDRESS = {Big Sky, MT}, MONTH = {March 10--15}}

@InProceedings{SeadaHG04, AUTHOR = {Seada, K. and Helmy, A. and Govindan, R.}, TITLE = {On the Effect of Localization Errors on Geographic Face

Routing in Sensor Networks}, BOOKTITLE = {Proceedings of the $3$rd IEEE/ACM International Symposium

on Information Processing in Sensor Networks, IPSN 2004}, PAGES = {71--80}, YEAR = {2004}, ADDRESS = {Berkeley, CA}, MONTH = {April 26--17}}

@InProceedings{SeahE05, AUTHOR = {Seah, W. K. G. and Er, I. I.}, TITLE = {Clustering Overhead and Convergence Time Analysis of the

Mobility-based Multi-Hop Clustering Algorithm for Mobile Ad Hoc Networks},

BOOKTITLE = {Proceedings of the $11$th International Conference on Parallel and Distributed Systems, ICPADS 2005},

PAGES = {130--134}, YEAR = {2005}, VOLUME = {2}, ADDRESS = {Fukuoka, Japan}, MONTH = {July 20--22}}

@Article{SegallS81, AUTHOR = {Segall, A. and Sidi, M.}, TITLE = {A Failsafe Distributed Routing Protocol for Minimum Delay

Routing}, JOURNAL = IEEETC, VOLUME = {Com-29}, NUMBER = 5, PAGES = {689--695}, MONTH = {May}, YEAR = 1981, ABSTRACT = {Previous distributed routing protocols in data

communication networks that achieve minimum average delay are extended to take into consideration topological changes in the network (4 Refs.)}

}

@InProceedings{ShahRJB03, AUTHOR = {Shah, R. C. and Roy, S. and Jain, S. and Brunette, W.}, TITLE = {Data {MULE}s: Modeling a Three-tier Architecture for

Sparse Sensor Networks}, BOOKTITLE = {Proceedings of the First IEEE International Workshop on

Sensor Network Protocols and Applications, SNPA 2003}, PAGES = {30--41}, YEAR = {2003}, ADDRESS = {Anchorage, AK}, MONTH = {May 11}}

@InProceedings{ShangRZF03, AUTHOR = {Shang, Y. and Ruml, W. and Zhang, Y. and Fromherz, M. P.

J.}, TITLE = {Localization from Mere Connectivity}, BOOKTITLE = {Proceedings of the Fourth ACM International Symposium on

Mobile Ad Hoc Networking and Computing, MobiHoc 2003}, YEAR = {2003},

ISBN = {1-58113-684-6}, PAGES = {201--212}, ADDRESS = {Annapolis, Maryland, USA}, URL = {http://doi.acm.org/10.1145/778415.778439}, ALTURL = {http://www2.parc.com/spl/projects/ldc/}, MONTH = {June 1--3}}

@TechReport{ShinCTL05, AUTHOR = {Shin, J. and Choi, H. and Traynor, P. G. and {La Porta},

T. F.}, TITLE = {Network Formation Schemes for Dynamic Multi-Radio,

Multi-Hop Wireless Celluar Systems}, INSTITUTION = {The Pennsylvania State University}, YEAR = {2005}, NUMBER = {NAS-TR-0005-2005}, ADDRESS = {University Park, PA}}

@InProceedings{ShinKL06, AUTHOR = {Shin, J. and Kishen, P. and {La Porta}, T. F.}, TITLE = {Dynamic Multi-Frequency, Multi-Hop Wireless Cellular

Networks}, BOOKTITLE = {Proceedings of IFIP Med Hoc Net 2006}, YEAR = {2006}, ADDRESS = {Lipari, Italy}, MONTH = {June 14--17}}

@Misc{ShinLK06, AUTHOR = {Shin, M. and Lee, S. and Kim, Y.-A.}, TITLE = {Distributed Channel Assigment for Multi-Radio Wireless

Networks}, HOWPUBLISHED = {www.cs.umd.edu/~mhshin/paper/chaninfo.pdf}, YEAR = {2006}}

@InProceedings{SinhaSB01, AUTHOR = {Sinha, P. and Sivakumar, R. and Bharghavan, V.}, TITLE = {Enhancing Ad Hoc Routing with Dynamic Virtual

Infrastructures}, BOOKTITLE = {Proceedings of IEEE Infocom 2001}, PAGES = {1763--1762}, YEAR = {2001}, VOLUME = {3}, ADDRESS = {Anchorage, AK},

MONTH = {April 22-26}}

@InProceedings{SivakumarDB98a, AUTHOR = {Sivakumar, R. and Das, B. and Bharghavan, V.}, TITLE = {The Clade Vertebrata: Spines and Routing in Ad Hoc

Networks}, BOOKTITLE = {Proceedings of the IEEE Symposium on Computer

Communications ({ISCC'98})}, YEAR = 1998, ADDRESS = {Athens, Greece}, MONTH = {June 30--July 2}}

@Article{SivakumarDB98b, AUTHOR = {Sivakumar, R. and Das, B. and Bharghavan V.}, TITLE = {Spine-based Routing in Ad Hoc Networks}, JOURNAL = {ACM/Baltzer Cluster Computing Journal}, YEAR = 1998, VOLUME = 1, PAGES = {237--248}, MONTH = {November}, NOTE = {Special Issue on Mobile Computing}}

@Article{SivakumarSB99, AUTHOR = {Sivakumar, R. and Sinha, P. and Bharghavan, V.}, TITLE = {{CEDAR}: A Core-Extraction Distributed Ad Hoc Routing

Algorithm}, JOURNAL = {IEEE Journal on Selected Areas in Communications}, YEAR = {1999}, VOLUME = {17}, NUMBER = {8}, PAGES = {1454--1465}, MONTH = {August}}

@InProceedings{SivavakeesarP05, AUTHOR = {Sivavakeesar, S. and Pavlou, G.}, TITLE = {Scalable Location Services for Hierarchically Organized

Mobile Ad Hoc Networks}, BOOKTITLE = {Proceedings of the $6$th ACM International Symposium on

Mobile Ad Hoc Networking and Computing, MobiHoc 2005}, PAGES = {217--228}, YEAR = {2005}, ADDRESS = {Urbana-Champaign, IL},

MONTH = {May 25--28}}

@InProceedings{SmallH05, AUTHOR = {Small, T. and Haas, Z. J.}, TITLE = {Resource and Performance Tradeoffs in Delay-Tolerant

Wireless Networks}, BOOKTITLE = {Proceedings of the ACM SIGCOMM 2005 Workshop on

Delay-Tolerant Networking and Related Networks, WDTN 2005}, YEAR = {2005}, ADDRESS = {Philadelphia, PA}, MONTH = {August 22--26}}

@Article{SohrabiGAP00, AUTHOR = {Sohrabi, K. and Gao, J. and Ailawadhi, V. and Pottie, G.

J.}, TITLE = {Protocols for Self-Organization of a Wireless Sensor

Network}, JOURNAL = {IEEE Personal Communications}, YEAR = {2000}, VOLUME = {7}, NUMBER = {5}, PAGES = {16--27}, MONTH = {October}}

@Article{SomasundaraKJES06, AUTHOR = {Somasundara, A. A. and Kansal, A. and Jea, D. D. and

Estrin, D. and Srivastava, M. B.}, TITLE = {Controllably Mobile Infrastructure for Low Energy Embedded

Networks}, JOURNAL = {IEEE Transactions on Mobile Computing}, PAGES = {958--973}, YEAR = {2006}, VOLUME = {5}, NUMBER = {8}, MONTH = {August}}

@InProceedings{SomasundaraRS04, AUTHOR = {Somasundara, A. A. and Ramamoorthy, A. and Srivastava, M.

B.}, TITLE = {Mobile Element Scheduling for Efficient Data Collection in

Wireless Sensor Networks with Dynamic Deadlines}, BOOKTITLE = {Proceedings of the $25$th IEEE International Real-Time

Systems Symposium, RTSS 2004}, PAGES = {296--305}, YEAR = {2004}, ADDRESS = {Lisbon, Portugal}, MONTH = {December 5--8}}

@InProceedings{SongH05, AUTHOR = {Song, L. and Hatzinakos, D.}, TITLE = {Dense Wireless Sensor Networks with Mobile Sinks}, BOOKTITLE = {Proceedings of the IEEE International Conference on

Acoustic Speech, and Signal Processing, ICASSP 2005}, PAGES = {677--680}, VOLUME = {3}, YEAR = {2005}, ADDRESS = {Philadelphia, PA}, MONTH = {March 18--23}}

@InProceedings{SoyturkA06, AUTHOR = {Soyturk, M. and Altilar, T.}, TITLE = {A Novel Stateless Energy-Efficient Routing Algorithm for

Large-Scale Wireless Sensor Networks with Multiple Sinks}, BOOKTITLE = {Proceedings of the IEEE Annual Wireless and Microwave

Technology Conference, WAMICON 2006}, PAGES = {1--5}, YEAR = {2006}, ADDRESS = {Clearwater Beach, FL}, MONTH = {December 4--5}}

@InProceedings{SoyturkA07, AUTHOR = {Soyturk, M. and Altilar, T.}, TITLE = {A Routing Algorithm for Mobile Multiple Sinks in

Large-Scale Wireless Sensor Networks}, BOOKTITLE = {Proceedings of the IEEE International Symposium on

Wireless Pervasive Computing, ISWPC 2007}, PAGES = {65--70}, YEAR = {2007}, ADDRESS = {San Juan, PR}, MONTH = {February 5--7}}

@Article{SozerSP00, AUTHOR = {Sozer, E. M. and Stojanovic, M. and Proakis, J. G.}, TITLE = {Underwater Acoustic Networks},

JOURNAL = {IEEE Journal of Oceanic Engineering}, VOLUME = 25, NUMBER = 1, PAGES = {72--83}, MONTH = {January}, YEAR = 2000}

@InProceedings{SozerS05, AUTHOR = {Sozer, E. and Stojanovic, M.}, TITLE = {Simulation and Rapid Prototyping Environment for {AUV} Networks}, BOOKTITLE = {Proceedings of the $14$th International Symposyum on

Unmanned Untethered Submersible Technology, UUST 2005}, YEAR = {2005}, ADDRESS = {Durham, NH}, MONTH = {August 21--25}}

@InProceedings{SpyropoulosPR06, AUTHOR = {Spyropoulos, T. and Psounis, K. and Raghavendra, C. S.}, TITLE = {Performance Analysis of Mobility-assisted Routing}, BOOKTITLE = {Proceedings of the $7$th ACM International Symposium on

Mobile Ad Hoc Networking and Computing, MobiHoc 2006}, PAGES = {49--60}, YEAR = {2006}, ADDRESS = {Firenze, Italy}, MONTH = {May 22--25}}

@InProceedings{StajanoA99, AUTHOR = {Stajano, F. and Anderson, R. J.}, TITLE = {The Resurrecting Duckling: Security Issues for Ad-hoc

Wireless Networks}, BOOKTITLE = {Security Protocols Workshop}, PAGES = {172--194}, YEAR = {1999}}

@Book{Steenstrup95, EDITOR = {Steenstrup, M. E.}, TITLE = {Routing in Communication Networks}, PUBLISHER= {Prentice Hall}, ADDRESS = {Englewood Cliffs, NJ}, YEAR = 1995}

@Book{Steuer86, AUTHOR = {Steuer, R. E.}, TITLE = {Multiple Criteria Optimization: Theory, Computation and

Applications}, PUBLISHER= {John Wiley \& Sons, Ltd.}, YEAR = {1986}, SERIES = {Wiley Series in Probability and Mathematical Statistics}}

@Article{StoerW97, AUTHOR = {Stoer, M. and Wagner, F.}, TITLE = {A Simple Min-cut Algorithm}, JOURNAL = {Journal of the ACM}, YEAR = {1997}, VOLUME = {44}, NUMBER = {4}, PAGES = {585--591}, MONTH = {July}}

@InProceedings{Stojanovic06, AUTHOR = {Stojanovic, M.}, TITLE = {On the Relationship Between Capacity and Distance in an

Underwater Acoustic Channel}, BOOKTITLE = {Proceedings of the First ACM International Workshop on

UnderWater Networks, WuWNet 2006}, YEAR = {2006}, ADDRESS = {Los Angeles, CA}, MONTH = {September 25}}

@Book{Stojmenovic01, EDITOR = {Stojmenovic, I.}, TITLE = {Handbook of Wireless Networks and Mobile Computing}, PUBLISHER= {John Wiley \& Son., Inc.}, YEAR = 2001, MONTH = {April}, ADDRESS = {New York, NY}}

@InProceedings{Stojmenovic02, AUTHOR = {Stojmenovic, I.}, TITLE = {Dominating Set Based {B}luetooth Scatternet Formation with

Localized Maintenance}, BOOKTITLE = {Proceedings of the Workshop on Advances in Parallel and

Distributed Computational Models}, YEAR = {2002}, ADDRESS = {Fort Lauderdale, FL}, MONTH = {April}}

@Article{Stojmenovic02a, AUTHOR = {Stojmenovic, I.}, TITLE = {Position based routing in ad hoc networks}, JOURNAL = {IEEE Communication Magazine}, YEAR = {2002}, VOLUME = {40}, NUMBER = {7}, PAGES = {128--134}, MONTH = {July}}

@InCollection{Stojmenovic02b, AUTHOR = {Stojmenovic, I.}, TITLE = {Location Updates for Efficient Routing in Ad Hoc Wireless

Networks}, BOOKTITLE = {Handbook of Wireless Networks and Mobile Computing}, PAGES = {451--471}, PUBLISHER= {John Wiley and Sons, Inc.}, YEAR = {2002}, EDITOR = {Stojmenovic, I.}, CHAPTER = {21§}, ADDRESS = {Hoboken, NJ}, MONTH = {April}}

@Article{StojmenovicSZ02, AUTHOR = {Stojmenovic, I. and Seddigh, M. and Zunic, J.}, TITLE = {Dominating Sets and Neighbors Elimination-Based

Broadcasting Algorithms in Wireless Networks}, JOURNAL = {IEEE Transactions on Parallel and Distributed Systems}, YEAR = {2002}, VOLUME = {13}, NUMBER = {1}, PAGES = {14--25}, MONTH = {January}}

@InCollection{StojmenovicW04, AUTHOR = {Stojmenovic, I. and Wu, J.}, TITLE = {Broadcasting and Activity Scheduling in Ad Hoc Networks},

BOOKTITLE = {Mobile Ad Hoc Networking}, PAGES = {205--229}, PUBLISHER= {IEEE Press and John Wiley and Sons, Inc.}, YEAR = {2004}, EDITOR = {Basagni, S. and Conti, M. and Giordano, S. and

Stojmenovic, I.}, CHAPTER = {7}, ADDRESS = {Piscataway, NJ and New York, NY}, MONTH = {April}}

@InCollection{StojmenovicZ06, AUTHOR = {Stojmenovic, I. and Zaguia, N.}, TITLE = {Bluetooth Scatternet Formation in ad Hoc Wireless

Networks}, BOOKTITLE = {Performance Modeling and Analysis of Bluetooth Networks:

Network Formation, Polling, Scheduling, and Traffic Control},

PAGES = {149--171}, PUBLISHER= {CRC Press}, YEAR = {2006}, EDITOR = {J.~ Mi\v{s}i\'{c} and V.~B.~ Mi\v{s}i\'{c}}, CHAPTER = {9}, ADDRESS = {Boca Raton, FL}}

@Misc{streettrips, HOWPUBLISHED = {http://www.microsoft.com/streets/default.mspx}}

@Misc{stumblerparser, HOWPUBLISHED = {http://kb3ipd.com/phpStumblerParser/index.php}}

@InProceedings{SucecM02, AUTHOR = {Sucec, J. and Marsic, I.}, TITLE = {Location Management for Hierarchically Organized Mobile Ad

Hoc Networks}, BOOKTITLE = {Proceedings of the IEEE Wireless Communications and

Networking Conference, WCNC 2002}, PAGES = {603--607}, VOLUME = 2, YEAR = {2002}, ADDRESS = {Orlando, FL}, MONTH = {March 17--21}}

@Article{SuHG98, AUTHOR = {Su, J. K. and Hartung, F. and Girod, B.}, TITLE = {Digital Watermarking of Text, Image and Video Documents}, JOURNAL = {Computers \& Graphics}, VOLUME = 22, NUMBER = 6, PAGES = {687--695}, MONTH = {December}, YEAR = 1998, ABSTRACT = {The ease of reproduction, distribution, and manipulation

of digital documents creates problems for authorized parties that wish to prevent illegal use of such documents. To this end, digital watermarking has been proposed as a last line of defense. A digital watermark is an imperceptible, robust, secure message embedded directly into a document. The watermark is imperceptible both perceptually and statistically. Robustness means that the watermark cannot be removed or modified unless the document is altered to the point of no value. The watermark is secure if unauthorized parties cannot erase or modify it. Current watermarking schemes may be viewed as spread-spectrum communications systems, which transmit a message redundantly using a low-amplitude, pseudo-noise carrier signal. An example highlights the basic mechanisms and properties of spread spectrum and their relation to watermarking. Finally, specific issues in watermarking of text, images, and video are discussed, along with watermarking examples. (26 References).}

}

@InProceedings{SunCL02, AUTHOR = {Sun, M.-T. and Chang, C.-K. and Lai, T.-H.}, TITLE = {A Self-Routing Topology for Bluetooth Scatternets}, BOOKTITLE = {Proceedings of the International Symposium on Parallel

Architectures, Algorithms, and Networks, {I-SPAN} 2002}, PAGES = {13--18}, YEAR = {2002}, ADDRESS = {Manila, Philippines}, MONTH = {May 22--24}}

@Book{Suppes60, AUTHOR = {P. Suppes}, TITLE = {Axiomatic Set Theory}, PUBLISHER= {D. Van Nostrand},

YEAR = 1960}

@InProceedings{SuzukiBW06, AUTHOR = {Sun, M.-T. and Chang, C.-K. and Lai, T.-H.}, TITLE = {Dispersive{C}ast: Dispersive Packets Transmission to

Multiple sinks for Energy Saving in Sensor Networks}, BOOKTITLE = {Proceedings of the $17$th IEEE International Symposium on

Personal, Indoor and Mobile Radio Communications, PIMRC 2006},

PAGES = {1--5}, YEAR = {2006}, ADDRESS = {Helsinki, Finland}, MONTH = {September}}

@InProceedings{SyedH06, AUTHOR = {Syed, A. A. and Heidemann, J.}, TITLE = {Time Synchronization for High Latency Acoustic Networks}, BOOKTITLE = {Proceedings of the $25$th IEEE International Conference on Computer Communications, INFOCOM 2006}, PAGES = {1--12}, YEAR = {2006}, ADDRESS = {Barcelona, Spain}, MONTH = {April 23--29}}

@InProceedings{SyrotiukCL03, AUTHOR = {Syrotiuk, V. R. and Colbourn, C. J. and Ling, A. C. H.}, TITLE = {Topology-Transparent Scheduling for MANETs using

Orthogonal Arrays}, BOOKTITLE = {Proceedings of the Joint Workshop on Foundations of Mobile

Computing, Dail M-POMC 2003}, PAGES = {43--49}, YEAR = {2003}, ADDRESS = {San Diego, CA}, MONTH = {September 19}}

@InProceedings{SyrotiukS02, AUTHOR = {Syrotiuk, V. R. and Sevugam, M.}, TITLE = {Mobility Independent Medium Access Control in Support of

Multimedia}, BOOKTITLE = {Proceedings of the $5$th International IEEE Symposium on

Wireless Personal Multimedia Communications, WPMC 2002}, PAGES = {907--910},

YEAR = {2002}, ADDRESS = {Honolulu, HA}, MONTH = {October 27--30}}

@Book{Szczepaniak99, EDITOR = {Szczepaniak, P. S.}, TITLE = {Computational Intelligence and Applications}, PUBLISHER= {Physica-Verlag, A Springer-Verlag Company}, ADDRESS = {Heidelberg, Germany}, YEAR = 1999}

@InProceedings{SzegedyV93, AUTHOR = {Szegedy, M. and Vishwanathan, S.}, TITLE = {Locality based graph coloring}, BOOKTITLE = {Proceedings of the $25$th Annual ACM Symposium on Theory

of Computing}, PAGES = {201--207}, ADDRESS = {San Diego, CA}, MONTH = {16--18 May}, YEAR = 1993, ABSTRACT = {We study the problem of locality based graph coloring.

This problem is motivated by the problem of assigning time slots for broadcast in mobile packet radio networks. This problem has also been studied in the context of distributed and parallel graph coloring. In this problem, one has to design a coloring algorithm that assigns a color to a vertex based on the label of the vertex and the labels on its neighbours. N. Linial (1992) proved an upper bound of O( Delta /sup 2/ log n) and a lower bound of R(log log n) on the number of colors needed to locally color an n-vertex graph with maximum vertex degree Delta . His main motivation was that repeated application of local coloring gives a fast algorithm for distributed coloring. He proved that one could get a Delta /sup 2/ coloring in O(log* n) steps this way. In this paper we improve upon the bounds for the problem of local coloring. Using a new characterization in terms of a family of set systems we design a randomized algorithm for the problem and prove an upper bound of O( Delta .2/sup Delta / log log n). An important question left open in Linial's paper was the case of large Delta . The best lower bound was Delta +1. Linial observed that a result of Erdos, Frankl and Furedi implied that his method cannot be applied to reduce the number of colors to below (/sub 2//sup Delta +2/). We obtain lower

bounds that match the upper bounds within a factor that is poly-logarithmic in terms of these bounds. Of particular interest we have very precise bounds for the case when Delta >2 square root n. These bounds are useful to obtain a heuristic estimate on the number of steps necessary to reduce the size of the color set from Delta /sup 2/ to Delta +1, when local coloring algorithms are used iteratively. The number of steps turns out to be theta ( Delta log Delta ) (10 Refs.)}

}

@InProceedings{SzewczykMPC04, AUTHOR = {Szewczyk, R. and Mainwaring, A. and Polastre, J. and

Anderson, J. and Culler, D.}, TITLE = {An Analysis of a Large Scale Habitat Monitoring

Application}, BOOKTITLE = {Proceedings of the $2$nd ACM Conference on Embedded

Networked Sensor Systems, SenSys 2004}, PAGES = {214--226}, YEAR = {2004}, ADDRESS = {Baltimore, MD}, MONTH = {November 3--5}}

@Article{SzewczykOPHME04, AUTHOR = {Szewczyk, R. and Osterweil, E. and Polastre, J. and

Hamilton, M. and Mainwaring, A. and Estrin, D.}, TITLE = {Application Driven Research: Habitat Monitoring with

Sensor Networks}, JOURNAL = {Communications of the ACM, Special Issue on Wireless

Sensor Networks}, YEAR = {2004}, VOLUME = {47}, NUMBER = {6}, PAGES = {34--40}, MONTH = {June}}

@Article{TakagiK84, AUTHOR = {Takagi, H. and Kleinrock, L.}, TITLE = {Optimal Transmission Ranges for Randomly Distributed

Packet Radio Terminals}, JOURNAL = {IEEE Transactions on Communications}, VOLUME = {COM-32}, NUMBER = 3, PAGES = {246--257},

MONTH = {March}, YEAR = 1984, ABSTRACT = {In multihop packet radio networks with randomly

distributed terminals, the optimal transmission radii to maximize the expected progress of packets in desired directions are determined for a variety of transmission protocols and network configurations. It is shown that FM capture performance is greatly improved by using slotted ALOHA due to the more limited area of possibly interfering terminals around the receiver. Slotted nonpersistent carrier-sense multiple-access (CSMA) only slightly outperforms ALOHA, unlike the single-hop case (where a large improvement is available), because of the large area of 'hidden' terminals and the long vulnerable period generated by them. As an example of an inhomogeneous terminal distribution, the effect of a gap in an otherwise randomly distributed terminal population on the expected progress of packets crossing the gap is considered. In this case, the disadvantage of using a large transmission radius is demonstrated (9 Refs.)}

}

@Article{TakahashiM80, AUTHOR = {Takahashi, H. and Matsuyama, A.}, TITLE = {An Approximate Solution for the Steiner Problem in

Graphs}, JOURNAL = {Math.\ Jap.}, VOLUME = 24, PAGES = {573--577}, YEAR = 1980}

@Article{Talluri98, AUTHOR = {Talluri, R.}, TITLE = {Error-Resilient Video Coding in the {ISO} {MPEG}-4

Standar}, JOURNAL = {IEEE Communications Magazine}, VOLUME = 36, NUMBER = 6, PAGES = {112--119}, MONTH = {June}, YEAR = 1998, ABSTRACT = {This article describes error resilience aspects of the

video coding techniques that are standardized in the ISO MPEC-4 standard. It begins with a description of the general problems in robust wireless video transmission. The

specific tools adopted into the ISO MPEG-4 standard to enable the communication of compressed video data over noisy wireless channels are presented in detail. These techniques include resynchronization strategies, data partitioning, reversible variable length codes (VLCs), and header extension codes. An overview of the evolving ISO MPEG-4 standard and its current status are described. (28 References).}

}

@InProceedings{TalucciG97, AUTHOR = {Talucci, F. and Gerla, M.}, TITLE = {{MACA-BI} ({MACA} by Invitation): A Wireless {MAC}

Protocol for High Speed Ad Hoc Networking}, BOOKTITLE = {Proceedings of IEEE ICUPC'97}, PAGES = {913--917}, YEAR = {1997}, VOLUME = {2}, ADDRESS = {San Diego, CA}, MONTH = {October}}

@InProceedings{Tan01, AUTHOR = {Tan, G.}, TITLE = {Interconnecting {B}luetooth-Like Personal Area Networks}, BOOKTITLE = {1st Annual Student Oxygen Workshop}, YEAR = {2001}, ADDRESS = {Gloucester, MA}, MONTH = {July 16}}

@Book{TanenbaumW10, AUTHOR = {Tanenbaum, A. S. and Wetherall, D.}, TITLE = {Computer Networks}, EDITION = {Fifth}, PUBLISHER= {Prentice Hall PTR}, ADDRESS = {Upper Saddle River, NJ}, YEAR = 2010}

@Book{Tanenbaum03, AUTHOR = {Tanenbaum, A. S.}, TITLE = {Computer Networks}, EDITION = {Fourth}, PUBLISHER= {Prentice Hall PTR}, ADDRESS = {Upper Saddle River, NJ},

YEAR = 2003}

@Book{Tanenbaum89, AUTHOR = {Tanenbaum, A. S.}, TITLE = {Computer Networks}, EDITION = {Second}, PUBLISHER= {Prentice Hall}, ADDRESS = {Englewood Cliffs, NJ}, YEAR = 1989}

@Book{Tanenbaum96, AUTHOR = {Tanenbaum, A. S.}, TITLE = {Computer Networks}, EDITION = {Third}, PUBLISHER= {Prentice Hall}, ADDRESS = {Englewood Cliffs, NJ}, YEAR = 1996}

@InProceedings{TangXZ05, AUTHOR = {Tang, J. and Guoliang, X. and Zhang, W.}, TITLE = {Interference-Aware Topology Control and {QoS} Routing in

Multi-Channel Wireless Mesh Networks}, BOOKTITLE = {Proceedings of the $6$th ACM International Symposium on

Mobile Ad Hoc Networking and Computing, MobiHoc 2005}, PAGES = {68--77}, YEAR = {2005}, ADDRESS = {Urbana-Champaign, IL}, MONTH = {May 25--28}}

@TechReport{TanMGB01, AUTHOR = {Tan, G. and Miu, A. and Guttag, J. and Balakrishnan, H.}, TITLE = {Forming Scatternet from {B}luetooth }, INSTITUTION = {M.I.T.}, YEAR = {2001}, NUMBER = {LCS-TR-826}, ADDRESS = {Cambridge, MA}, MONTH = {October}}

@InProceedings{TanMGB02, AUTHOR = {Tan, G. and Miu, A. and Guttag, J. and Balakrishnan, H.}, TITLE = {An Efficient Scatternet Formation Algorithm for Dynamic

environment}, BOOKTITLE = {Proceedings of the IASTED Communications and Computer

Networks (CCN)}, YEAR = {2002}, ADDRESS = {Cambridge, MA}, MONTH = {November 4--6}}

@Article{TennenhouseSSWM97, AUTHOR = {Tennenhouse, D. L. and Smith, J. M. and Sincoskie, W. D.

and Wetherall, D. J. and Minden, G. J.}, TITLE = {A Survey of Active Network Research}, JOURNAL = CM, VOLUME = 35, NUMBER = 1, PAGES = {80--86}, MONTH = {January}, YEAR = 1997}

@Book{ThurstonPM03, AUTHOR = {Thurston, J. and Poiker, T. K. and Moore, J. P.}, TITLE = {Integrated Geospatial Technologies: A Guide to {GPS},

{GIS}, and Data Logging}, PUBLISHER= {John Wiley \& Sons, Inc.}, ADDRESS = {Hoboken, NJ}, YEAR = 2003}

@InProceedings{TillettRSR02, AUTHOR = {Tillett, J. and Rao, R. and Sahin, F. and Rao, T. M.}, TITLE = {Cluster-Head Identification in Ad Hoc Sensor Networks

Using Particle Swarm Optimization}, BOOKTITLE = {Proceedings of the IEEE International Conference on

Personal Wireless Communications, ICPWC 2002}, PAGES = {201--205}, YEAR = {2002}, ADDRESS = {New Delhi, India}, MONTH = {December 15--17}}

@InProceedings{TirtaLLS04, AUTHOR = {Tirta, Y. and Li, Z. and Lu, Y.-H. and Bagchi, S.}, TITLE = {Efficient Collection of Sensor Data in Remote Fields Using

Mobile Collectors}, BOOKTITLE = {Proceedings of the $13$th International Conference on

Computer Communications and Networks, ICCCN 2004}, PAGES = {515--519}, YEAR = {2004}, ADDRESS = {Chicago, IL}, MONTH = {October 11--13}}

@InCollection{TirtaLMBLL05, AUTHOR = {Tirta, Y. and Lau, B. and Malhotra, N. and Bagchi, S. and

Li, Z. and Lu, Y.-H.}, TITLE = {Controlled Mobility for Efficient Data Gathering in Sensor

Networks with Passively Mobile Nodes}, BOOKTITLE = {EEE Monograph on Sensor Network Operations}, PAGES = {92--112}, PUBLISHER= {IEEE-Wiley Press}, YEAR = {2006}, EDITOR = {Phoha, S. and La~Porta, T. F. and Griffin, C.}, CHAPTER = {3.2}, ADDRESS = {Piscataway, NJ}, MONTH = {May}}

@Article{TobagiK75, AUTHOR = {Tobagi, F. A. and Kleinrock, L.}, TITLE = {Packet Switching in Radio Channels.\ II.\ The Hidden

Terminal Problem in Carrier Sense Multiple-Access and the Busy-Tone Solution},

JOURNAL = {IEEE Transactions on Communications}, YEAR = {1975}, VOLUME = {COM-23}, NUMBER = {12}, PAGES = {1417--1433}, MONTH = {December}}

@Book{Toh02, AUTHOR = {Toh, C.-K.}, TITLE = {Ad Hoc Mobile Wireless Networks, Protocols and Systems}, PUBLISHER= {Prentice Hall/PTR}, YEAR = 2002, ADDRESS = {Upper Saddle River, NJ}}

@Book{TonguzF06, AUTHOR = {Tonguz, O. K. and Ferrari, G.}, TITLE = {Ad Hoc Wireless Networks},

PUBLISHER= {John Wiley \& Son., LTD}, YEAR = 2006, ADDRESS = {West Sussex, UK}}

@InProceedings{TongZA03, AUTHOR = {Tong, L. and Zhao, Q. and Adireddy, S.}, TITLE = {Sensor Networks with Mobile Agents}, BOOKTITLE = {Proceedings of the IEEE Military Communication Conference,

MILCOM 2003}, PAGES = {705--710}, YEAR = {2003}, VOLUME = {1}, ADDRESS = {Boston, MA}, MONTH = {October 13--16}}

@Article{TsengNCS02, AUTHOR = {Tseng, Y.-C. and Ni, S.-Y. and Chen, Y.-S. and Sheu,

J.-P.}, TITLE = {The Broadcast Storm Problem in a Mobile Ad Hoc Network}, JOURNAL = {ACM/Kluwer Wireless Networks}, VOLUME = 8, NUMBER = {2/3}, PAGES = {153--167}, MONTH = {March--May}, YEAR = 2002}

@Book{Tutte84, AUTHOR = {Tutte, W. T.}, TITLE = {Graph Theory}, PUBLISHER= AW, ADDRESS = {Reading, MA}, YEAR = {1984}}

@Book{Urick83, AUTHOR = {Urick, R.}, TITLE = {Principles of Underwater Sound}, PUBLISHER= {McGraw-Hill}, YEAR = {1983}}

@TechReport{VahdatB00, AUTHOR = {Vahdat, A. and Becker, D.},

TITLE = {Epidemic Routing for Partially Connected Ad Hoc Networks}, INSTITUTION = {Duke University}, YEAR = {2000}, NUMBER = {CS-200006}, ADDRESS = {Durham, NC}, MONTH = {April}}

@InProceedings{VasilescuKRDC05, AUTHOR = {Vasilescu, I. and Kotay, K. and Rus, D. and Dunbabin, M.

and Corke, P.}, TITLE = {Data Collection, Storage and Retrieval with an Underwater

Sensor Network}, BOOKTITLE = {Proceedings of the $3$rd ACM Conference on Embedded

Networked Sensor Systems, SenSys 2005}, YEAR = {2005}, ADDRESS = {San Diego, CA}, MONTH = {November, 2--4}}

@Book{Vazirani01, AUTHOR = {Vazirani, V. V.}, TITLE = {Approximation Algorithms}, PUBLISHER= {Springer Verlag}, YEAR = {2001}, ADDRESS = {Berlin, Germany}}

@Article{VenkitasubramaniamAT04, AUTHOR = {Venkitasubramaniam, P. and Adireddy, S. and Tong, L.}, TITLE = {Sensor Networks with Mobile Agents: Optimal Random Access

and Coding}, JOURNAL = {IEEE Journal on Selected Areas in Communications}, YEAR = {2004}, VOLUME = {22}, NUMBER = {6}, PAGES = {1058--1068}, MONTH = {August}}

@InProceedings{VenkitasubramaniamZT02, AUTHOR = {Venkitasubramaniam, P. and Zhao, Q. and Tong, L.}, TITLE = {Sensor Networks with Multiple Mobile Access Points}, BOOKTITLE = {Proceedings of the $38$th Annual Conference on Information

Sciences and Systems, CISS 2004}, YEAR = {2002},

ADDRESS = {Princeton, NJ}, MONTH = {March 17--19}}

@InProceedings{VinczeVV07, AUTHOR = {Vincze, Z. and Vida, R. and Vid\'acs, A.}, TITLE = {Deploying Multiple Sinks in Multi-hop Wireless Sensor

Networks}, BOOKTITLE = {Proceedings of the IEEE International Conference on

Pervasive Services, ICPS 2007}, PAGES = {55--63}, YEAR = {2007}, ADDRESS = {Istanbul, Turkey}, MONTH = {July 15--20}}

@InProceedings{VironeWSCFDHSLS06, AUTHOR = {Virone, G. and Wood, A. and Selavo, L. and Cao, Q. and

Fang, L. and Doan, T. and He, Z. and Stoleru, R. and Lin, S. and Stankovic, J. A.},

TITLE = {An Assisted Living Oriented Information System Based on a Residential Wireless Sensor Network},

BOOKTITLE = {Proceedings of the $1$st Distributed Diagnosis and Home Healthcare (D2H2) Conference},

PAGES = {95--100}, YEAR = {2006}, ADDRESS = {Arlington, VA}, MONTH = {April 2--4}}

@InProceedings{VuranA08, AUTHOR = {Vuran, M. C. and Akyildiz, I. F.}, TITLE = {Cross-Layer Packet Size Optimization for Wireless Terrestrial, Underwater, and Underground Sensor Networks}, BOOKTITLE = {Proceedings of IEEE INFOCOM 2008}, PAGES = {226--230}, YEAR = {2008}, ADDRESS = {Phoenix, AZ}, MONTH = {April 13--18}}

@Article{VuranA10, AUTHOR = {Vuran, M. C. and Akyildiz, I. F.}, TITLE = {{XLP}: A Cross Layer Protocol for Efficient Communication in Wireless Sensor Networks}, JOURNAL = {IEEE Transactions on Mobile Computing},

VOLUME = {9}, NUMBER = {11}, PAGES = {1578--1591}, YEAR = {2010}, MONTH = {November}}

@InProceedings{WanAF02, AUTHOR = {Wan, P.-J. and Alzoubi, K. M. and Frieder, O.}, TITLE = {Distributed Construction of Connected Dominating Sets in Wireless Ad Hoc Networks}, BOOKTITLE = {Proceedings of the $21$st IEEE Infocom 2002}, PAGES = {1597--1604}, YEAR = {2002}, VOLUME = {3}, ADDRESS = {New York, NY}, MONTH = {June 23--27}}

@Article{WanAF04, AUTHOR = {Wan, P.-J. and Alzoubi, K. M. and Frieder, O.}, TITLE = {Distributed Construction of Connected Dominating Sets in

Wireless Ad Hoc Networks}, JOURNAL = {ACM/Kluwer Mobile Networks and Applications, MONET}, YEAR = {2004}, VOLUME = {9}, NUMBER = {2}, PAGES = {141--149}, MONTH = {April}}

@InProceedings{WangCL04, AUTHOR = {Wang, G. and Cao, G. and La~Porta, T. F.}, TITLE = {Movement-Assisted Sensor Deployment}, BOOKTITLE = {Proceedings of IEEE INFOCOM 2004}, PAGES = {2469--2479}, YEAR = {2004}, VOLUME = {4}, ADDRESS = {Hong Kong}, MONTH = {March 7--11}}

@InProceedings{WangCL04a, AUTHOR = {Wang, G. and Cao, G. and La~Porta, T. F.}, TITLE = {Proxy-Based Sensor Deployment for Mobile Sensor Networks},

BOOKTITLE = {Proceedings of the First IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2004}, PAGES = {493--502}, YEAR = {2004}, ADDRESS = {Fort Lauderdale, FL}, MONTH = {October 25--27}}

@Article{WangCL06,author = {Wang, G. and Cao, G. and La~Porta, T. F.},title = {Movement-Assisted Sensor Deployment},journal = {IEEE Transactions on Mobile Computing},year = {2006},volume = {6}}

@InProceedings{WangCLM06, AUTHOR = {Wang, H. and Cen, Z. and Li, T. and Mutka, M.}, TITLE = {A Topology-Aware Routing Protocol for the {MANET} with

Multiple Sinks}, BOOKTITLE = {Proceedings of the IEEE International Conference on

Electro/Information Technology, EIT 2006}, PAGES = {318--323}, YEAR = {2006}, ADDRESS = {East Lansing, MI}, MONTH = {May 7--10}}

@Article{WangO04, AUTHOR = {Wang, L. and Olariu, S.}, TITLE = {A Unifying Look at Clustering in Mobile Ad Hoc Networks}, JOURNAL = {Wireless Communications and Mobile Computing}, YEAR = {2004}, VOLUME = {4}, NUMBER = {6}, PAGES = {623--637}, MONTH = {September}}

@InProceedings{WangSC05, AUTHOR = {Wang, W. and Srinivasan, V. and Chua, K.-C.}, TITLE = {Using Mobile Relays to Prolong the Lifetime of Wireless

Sensor Networks}, BOOKTITLE = {Proceedings of the $11$th Annual ACM/SIGMOBILE

International Conference on Mobile Computing and Networking, MobiCom 2005},


@InProceedings{WangTH02, AUTHOR = {Wang, Z. and Thomas, R. J. and Haas, Z.}, TITLE = {Blue{N}et---{A} New Scatternet Formation Scheme}, BOOKTITLE = {Proceedings of the 35th Hawaii International Conference on

System Science ({HICSS}-35)}, YEAR = {2002}, ADDRESS = {Big Island, Hawaii}, MONTH = {January 7--10}}

@InProceedings{WangW07, AUTHOR = {Wang, H.-H. and Wang, S.-D.}, TITLE = {The Modified Grid Location Service for Mobile Ad-hoc

Networks}, BOOKTITLE = {Proceedings of the $2$nd International Conference on Grid

and Pervasive Computing, GPC 2007}, PAGES = {334--347}, SERIES = {LNCS}, VOLUME = 4459, YEAR = {2007}, ADDRESS = {Paris, France}, MONTH = {May 2--4}}

@Article{WantHFG92, AUTHOR = {Want, R. and Hopper, A. and Falcao, V. and Gibbons, J.}, TITLE = {The Active Badge Location System}, JOURNAL = {ACM Transactions on Information System}, VOLUME = 10, NUMBER = 1, PAGES = {91-102}, MONTH = {January}, YEAR = 1992, ABSTRACT = {A system for the location of people in an office

environment is described. Members of staff wear badges that transmit signals providing information about their location to a centralized location service, through a network of sensors. The paper also examines alternative location techniques, system design issues and applications, particularly relating to telephone call routing. Location

systems raise concerns about the privacy of an individual, and these issues are also addressed (6 Refs.)}

}

@Misc{WAP, AUTHOR = {WiFi Alliance}, TITLE = {WPA2 (Wi-Fi Protected Access 2)}, HOWPUBLISHED = {http://www.wi-fi.org/OpenSection/knowledge\_center/ wpa2/}, MONTH = {February 6}, YEAR = {2006}}

@Misc{wcn, TITLE = {Wireless Community Network}, HOWPUBLISHED = {http://en.wikipedia. org/ wiki/

Wireless\_community\_network}, YEAR = {2006}}

@Article{Weiser93, AUTHOR = {Weiser, M.}, TITLE = {Ubiquitous Computing}, JOURNAL = {IEEE Computer}, YEAR = {1993}, VOLUME = {26}, NUMBER = {10}, PAGES = {71--72}, MONTH = {October}}

@Book{Weisstein98, AUTHOR = {Weisstein, E. W.}, TITLE = {CRC Concise Encyclopedia of Mathematics}, PUBLISHER= {CRC Press}, ADDRESS = {Boca Raton, FL}, YEAR = 1998, NOTE = {(See also: http://www.treasure-troves.com/math/)}}

@InProceedings{Westphal07a, AUTHOR = {Westphal, C.}, TITLE = {Little {T}om {T}humb Went Straight Home. {A}symptotic

Behavior of a Routing Protocol in Ad Hoc Networks with a Mobile Access Point},

BOOKTITLE = {Proceedings of the $26$th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2007},

PAGES = {1847--1856}, YEAR = {2007}, ADDRESS = {Anchorage, AK}, MONTH = {May 6--12}}

@InProceedings{Westphal07b, AUTHOR = {Westphal, C.}, TITLE = {Performance of Routing in Sensor Networks with a Mobile

Access Point}, BOOKTITLE = {Proceedings of the IEEE Wireless Communications and

Networking Conference, WCNC 2007}, PAGES = {4375--4370}, YEAR = {2007}, ADDRESS = {Hong Kong, China}, MONTH = {March 11--15}}

@Article{WhitakerHC05, AUTHOR = {Whitaker, R. M. and Hodge, L. E. and Chlamtac, I.}, TITLE = {Bluetooth Scatternet Foramtion: A Survey}, JOURNAL = {Elsevier's Ad Hoc Networks Journal}, VOLUME = {3}, NUMBER = {4}, PAGES = {403--450}, YEAR = {2005}}

@InProceedings{WhitehouseKWJC05, AUTHOR = {Whitehouse, D. and Karlof, C. and Woo, A. and Jiang, F.

and Culler, D.}, TITLE = {The Effect of Ranging Noise on Multihop Localization: An

Empirical Study}, BOOKTITLE = {Proceedings of the Fourth ACM/IEEE International Symposium

on Information Processing in Sensor Networks, IPSN 2005}, PAGES = {73--80}, YEAR = 2005, ADDRESS = {Los Angeles, CA}, MONTH = {April 25--27}}

@Article{Willard86, AUTHOR = {Willard, D. E.}, TITLE = {Log-logarithmic Selection Resolution Protocols in a

Multiple Access Channel},

JOURNAL = SIAMJC, VOLUME = 15, PAGES = {468--477}, YEAR = 1986}

@InProceedings{WilliamsC02, AUTHOR = {Williams, B. and Camp, T.}, TITLE = {Comparison of Broadcasting Techniques for Mobile Ad Hoc

Networks}, BOOKTITLE = {Proceedings of the $3$rd ACM International Symposium on

Mobile Ad Hoc Networking and Computing, MobiHoc 2002}, PAGES = {194--205}, YEAR = {2002}, ADDRESS = {Lausanne, Switzerland}, MONTH = {June 9--11}}

@Book{Wooden84, AUTHOR = {Wooden, W. H.}, TITLE = {NAVSTAR global positioning system overview}, PUBLISHER= {Defense Mapping Agency}, ADDRESS = {Washington, D.C.}, YEAR = {1984}}

@Article{WooS01, AUTHOR = {Woo, S.-C. M. and Singh, S.}, TITLE = {Scalable Routing Protocol for Ad Hoc Networks}, JOURNAL = {ACM/Kluwer Wireless Networks}, VOLUME = {7}, NUMBER = {5}, YEAR = {2001}, ISSN = {1022-0038}, PAGES = {513--529}, DOI = {http://dx.doi.org/10.1023/A:1016726711167}, MONTH = {September}}

@InProceedings{Wu03, AUTHOR = {Wu, J.}, TITLE = {An Enhanced Approach to Determine a Small Forward Node Set

Based on Multipoint Relay}, BOOKTITLE = {Proceedings of the $58$th IEEE Semiannual Vehicular

Technology Conferemce, VTC 2003-Fall},

PAGES = {2774--2777}, YEAR = {2003}, VOLUME = {4}, ADDRESS = {Orlando, FL}, MONTH = {October 6--9}}

@Article{WuCT05, AUTHOR = {Wu, H. and Wang, C. and Tzeng, N.-F.}, TITLE = {Novel Self-Configurable Positioning Technique for Multihop

Wireless Networks}, JOURNAL = {IEEE/ACM Transactions on Networking}, YEAR = 2005, VOLUME = 13, NUMBER = 3, PAGES = {609--621}, MONTH = {June}}

@Article{WuDGS02, AUTHOR = {Wu, J. and Dai, F. and Gao, M. and Stojmenovic, I.}, TITLE = {On Calculating Power-Aware Connected Dominating Sets for

Efficient Routing in Ad Hoc Wireless Networks}, JOURNAL = {Journal of Communications and Networks}, YEAR = {2002}, VOLUME = {4}, NUMBER = {1}, PAGES = {1--12}, MONTH = {March}}

@Article{WuL01, AUTHOR = {Wu, J. and Li, H.}, TITLE = {On Calculating Connected Dominating Sets for Efficient

Routing in Ad Hoc Wireless Networks}, JOURNAL = {Telecommunication Systems, Special Issue on Mobile

Computing and Wireless Networks}, VOLUME = {18}, NUMBER = {1/3}, EDITOR = {Olariu, S. and Stojmenovic, I.}, PAGES = {13--36}, MONTH = {September}, YEAR = {2001}}

@InProceedings{WuL04,

AUTHOR = {Wu, J. and Lou, W.}, TITLE = {Extended Multipoint Relay to Determine Connected

Dominating Sets in {MANETs}}, BOOKTITLE = {Proceedings of the first IEEE Communications Society

Conference on Sensor and Ad Hoc Communications and Networks, SECON 2004},

PAGES = {621--630}, YEAR = {2004}, ADDRESS = {Santa Clara, CA}, MONTH = {October 4--7}}

@Article{WuL87, AUTHOR = {Wu, C. and Li, V. O. K.}, TITLE = {Receiver-Initiated Busy Tone Multiple Access in Packet

Radio Networks}, JOURNAL = {ACM Computer Communication Review}, YEAR = {1987}, VOLUME = {17}, NUMBER = {5}, PAGES = {336--342}, MONTH = {August}}

@InProceedings{WuL99, AUTHOR = {Wu, J. and Li, H.}, TITLE = {On Calculating Connected Dominating Sets for Efficient

Routing in Ad Hoc Wireless Networks}, BOOKTITLE = {Proceedings of the $3$rd ACM International Workshop on

Discrete Algorithms and Methods for Mobile Computing and Communications (Dial M 1999)},

PAGES = {7--17}, YEAR = {1999}, ADDRESS = {Seattle, WA}, MONTH = {August 20}}

@InProceedings{WuZWN06, AUTHOR = {Wu, Y. and Zhang, L and Wu, Y. and Niu, Z.}, TITLE = {Interest Dissemination with Directional Antennas for

Wireless Sensor Networks with Mobile Sinks}, BOOKTITLE = {Proceedings of the $4$th ACM International Conference on

Embedded Networked Sensor Systems, SenSys 2006}, YEAR = {2006}, PAGES = {99--111}, ADDRESS = {Boulder, CO},

DOI = {http://doi.acm.org/10.1145/1182807.1182818}, PUBLISHER= {ACM}, MONTH = {October 31-November 3}}

@Book{Xiao10, EDITOR = {Xiao, Y.}, TITLE = {Underwater Acoustic Sensor Networks}, PUBLISHER= {Auerbach Publications}, YEAR = {2010}, ADDRESS = {Boca Raton, FL}, MONTH = {May 19}}

@InProceedings{XingWJL08, AUTHOR = {Xiang, G. and Wang, T. and Jia, W. and Li, M.}, TITLE = {Rendezvous Design Algorithms for Wireless Sensor Networks

with a Mobile Base Station}, BOOKTITLE = {Proceedings of the $9$th ACM International Symposium on

Mobile Ad Hoc Networking and Computing, MobiHoc 2008}, PAGES = {231--240}, YEAR = {2008}, ADDRESS = {Hong Kong, China}, MONTH = {May 27--30}}

@InProceedings{XuanL04, AUTHOR = {Xuan, H. L. and Lee, S.}, TITLE = {A Coordination-based Data Dissemination Protocol for

Wireless Sensor Networks}, BOOKTITLE = {Proceedings of the 2004 Intelligent Sensors, Sensor

Networks and Information Processing Conference, ISSNIP 2004},

PAGES = {13--18}, YEAR = {2004}, ADDRESS = {Melbourne, Australia}, MONTH = {December 14--17}}

@TechReport{XuBMHE03, AUTHOR = {Xu, Y. and Bien, S. and Mori, Y. and Heidemann, J. and

Estrin, D.}, TITLE = {Topology Control Protocols to Conserve Energy in Wireless

Ad Hoc Networks}, INSTITUTION = {University of California, Los Angeles, Center for Embedded

Networked Computing},

YEAR = {2003}, NUMBER = {6}, MONTH = {January}, URL = {http://www.isi.edu/~johnh/PAPERS/Xu03a.html}, ORGANIZATION = {USC/Information Sciences Institute}}

@Article{XueK04, AUTHOR = {Xue, F. and Kumar, P. R.}, TITLE = {The Number of Neighbors Needed for Connectivity of

Wireless Networks}, JOURNAL = {ACM/Kluwer Wireless Networks}, YEAR = {2004}, VOLUME = {10}, NUMBER = {2}, PAGES = {169--181}, MONTH = {March}}

@InProceedings{XueLN01, AUTHOR = {Xue, Y. and Li, B. and Nahrstedt, K.}, TITLE = {A Scalable Location Management Scheme in Mobile Ad-hoc

Networks}, BOOKTITLE = {Proceedings of the $26$th Annual IEEE Conference on Local

Computer Networks, LCN 2001}, PAGES = {102--111}, YEAR = {2001}, ADDRESS = {Tampa, FL}, MONTH = {November, 14--16}}

@InProceedings{XuHE01, AUTHOR = {Hu, Y. and Heidemann, J. and Estrin, D.}, TITLE = {Geography-Informed Energy Conservation for Ad Hoc

Routing}, BOOKTITLE = {Proceedings of the $7$th ACM Annual International

Conference on Mobile Computing and Networking}, PAGES = {70--84}, YEAR = {2001}, ADDRESS = {Rome, Italy}, MONTH = {July 16--21}}

@InProceedings{XuHE02, AUTHOR = {Xu, Y. and Heidemann, J. and Estrin, D.}, TITLE = {Energy conservation by adaptive clustering for ad hoc

networks}, BOOKTITLE = {Poster presented at ACM MobiHoc 2002}, ADDRESS = {Losanne, Switzerland}, YEAR = 2002}

@InProceedings{XuHG02, AUTHOR = {Xu, K. and Hong, X. and Gerla, M.}, TITLE = {An Ad Hoc Network with Mobile Backbones}, BOOKTITLE = {Proceedings of the IEEE International Conference on

Communications (ICC 2002)}, PAGES = {3138--3143}, YEAR = {2002}, VOLUME = {5}, ADDRESS = {New York, NY}, MONTH = {April 28--May 2}}

@InProceedings{YadumurthyCSM05, AUTHOR = {Yadumurthy, R. M. and Chimalakonda, A. and Sadashivaiah,

M. and Makanaboyina, R.}, TITLE = {Reliable {MAC} Broadcast Protocol in Directional and

Omni-directional Transmissions for Vehicular Ad hoc Networks},

BOOKTITLE = {Proceedings of the $2$nd ACM International Workshop on Vehicular Ad Hoc Networks, VANET 2005},

PAGES = {10--19}, YEAR = {2005}, ADDRESS = {Cologne, Germany}, MONTH = {September 2}}

@InProceedings{Yang06, AUTHOR = {Yang, L.}, TITLE = {Determining Sink Node Locations in Wireless Sensor

Networks}, BOOKTITLE = {Proceedings of the 2006 IEEE International Conference on

Systems, Man and Cybernetics, ICSMC 2006}, PAGES = {3400--3404}, VOLUME = 4, YEAR = {2006}, ADDRESS = {Taipei, Taiwan}, MONTH = {October 8--11}}

@InCollection{YangBMTS10,

AUTHOR = {Yang, L. T. and {Borgy Waluyo}, A. and Ma, J. and Tan, L. and Srinivasan, B.}, TITLE = {A Survey of State-of-the-Art Routing Protocols for Mobile Ad Hoc Networks}, BOOKTITLE = {Mobile Intelligence}, PAGES = {1--25}, PUBLISHER= {John Wiley \& Sons, Inc.}, YEAR = {2010}, EDITOR = {Datta, A. and Soundaralakshmi, S.}, CHAPTER = {1}, ADDRESS = {Hoboken, NJ}, MONTH = {February 22}}

@Article{Yao82, AUTHOR = {Yao, A. C.-C.}, TITLE = {On Constructing Minimum Spanning Trees in $k$-dimensional

Spaces and Related Problems}, JOURNAL = {SIAM Journal on Computing}, YEAR = {1982}, VOLUME = {11}, NUMBER = {4}, PAGES = {721--736}, MONTH = {November}}

@InProceedings{YeLCLZ02, AUTHOR = {Ye, F. and Luo, H. and Cheng, J. and Lu, S. and Zhang,

L.}, TITLE = {A Two-Tier Data Dissemination Model for Large Scale

Wireless Sensor Networks}, BOOKTITLE = {Proceedings of the $8$th ACM Annual International


PAGES = {148--159}, YEAR = {2002}, ADDRESS = {Atlanta, GA}, MONTH = {September 23--28}}

@InProceedings{YeZCLZ03, AUTHOR = {Ye, F. and Zhong, G. and Cheng, J. and Lu, S. and Zhang,

L.}, TITLE = {{PEAS}: A Robust Energy Conserving Protocol for Long-lived

Sensor Networks}, BOOKTITLE = {Proceedings of the $23$rd IEEE International Conference on

Distributed Computer Systems, {ICDCS 2003}}, PAGES = {28--37}, YEAR = {2003}, ADDRESS = {Providence, RI}, MONTH = {May 19--22}}

@InProceedings{YiGK03, AUTHOR = {Yi, Y. and Gerla, M. and Kwon, T. J.}, TITLE = {Efficient Flooding in Ad Hoc Networks: A Comparative

Performance Study}, BOOKTITLE = {Proceedings of the IEEE International Conference on

Communications, ICC 2003}, PAGES = {1059--1063}, YEAR = {2003}, VOLUME = {2}, ADDRESS = {Anchorage, AK}, MONTH = {May 11--15}}

@Article{YickMG08, AUTHOR = {Yick, J. and Mukherjee, B. and Ghosal, D.}, TITLE = {Wireless Sensor Network Survey}, JOURNAL = {Computer Networks}, YEAR = {2008}, VOLUME = {52}, NUMBER = {12}, PAGES = {2292--2330}, MONTH = {August 22}}

@InProceedings{YounisAK03, AUTHOR = {Younis, M. and Akkaya, K. and Kunjithapatham, A.}, TITLE = {Optimization of Task Allocation in Cluster-Based Sensor

Networks}, BOOKTITLE = {Proceedings of the $8$th IEEE International Symposium on


@InProceedings{YounisF04, AUTHOR = {Younis, O. and Fahmy, S.}, TITLE = {Distributed Clustering in Ad Hoc Sensor Networks: A Hybrid

Energy-Efficient Approach}, BOOKTITLE = {Proceedings of IEEE Infocom 2004}, PAGES = {629--640}, YEAR = {2004}, VOLUME = {1}, ADDRESS = {Hong Kong, China}, MONTH = {March 7--11}}

@Article{YounisF04a, AUTHOR = {Younis, O. and Fahmy, S.}, TITLE = {{HEED}: A Hybrid, Energy-Efficient, Distributed Clustering

Approach for Ad Hoc Sensor Networks}, JOURNAL = {IEEE Transactions on Mobile Computing}, YEAR = {2004}, VOLUME = {3}, NUMBER = {4}, PAGES = {366--379}, MONTH = {October--December}}

@InProceedings{YounisYA02, AUTHOR = {Younis, M. and Youssef, M. and Arisha, K.}, TITLE = {Energy-Aware Routing in Cluster-Based Sensor Networks}, BOOKTITLE = {Proceedings of the $10$th IEEE International Symposium on

Modeling, Analysis and Simulations of Computer and Telecommunication Systems (MASCOTS 2002)},

PAGES = {129--136}, YEAR = {2002}, ADDRESS = {Fort Worth, TX}, MONTH = {October 11--16}}

@InProceedings{YounKP04, AUTHOR = {Youn, J.-H. and Kalva, R. R. and Park, S.}, TITLE = {Efficient Data Dissemination and Aggregation in Large

Wireless Sensor Networks}, BOOKTITLE = {Proceedings of the $60$th IEEE Vehicular Technology

Conference, VTC 2004 Fall}, PAGES = {4602--4606}, YEAR = {2004}, VOLUME = {7}, ADDRESS = {Los Angeles, CA}, MONTH = {September 26--29}}

@InProceedings{YuanVJ05, AUTHOR = {Yuan, S. and Varma, S. and Ju, J. P.}, TITLE = {Minimum-Color Path Problems for Reliability in Mesh

Networks}, BOOKTITLE = {Proceedings of IEEE Infocom 2005}, PAGES = {2658--2669}, YEAR = {2005}, VOLUME = {4}, ADDRESS = {Miami, FL}, MONTH = {March 13--17}}

@InProceedings{YuSSXL06, AUTHOR = {Yu, B. and Scerri, P. and Sycara, K. and Xu, Y. and Lewis,

M.}, TITLE = {Scalable and Reliable Data Delivery in Mobile Ad Hoc

Sensor Networks}, BOOKTITLE = {Proceedings of ACM AAMAS 2006}, PAGES = {1071--1078}, YEAR = {2006}, ADDRESS = {Hokkaido, Japan}, MONTH = {May 8--12}}

@InProceedings{ZanellaMPR03, AUTHOR = {Zanella, A. and Miorandi, D. and Pupolin, S. and Raimondi,

P.}, TITLE = {On Providing Soft-{QoS} in Wireless Ad Hoc Networks}, BOOKTITLE = {Proceedings of WPMC 2003}, YEAR = {2003}, ADDRESS = {Yokosuka, Kanagawa, Japan}, MONTH = {October 21--22}}

@InProceedings{Zavgren97, AUTHOR = {Zavgren, J.}, TITLE = {{NTDR} Mobility Management Protocols and Procedures}, BOOKTITLE = {Proceedings of the MILCOM'97}, ADDRESS = {Monterrey, CA}, YEAR = 1997}

@Article{ZhangMC06, AUTHOR = {Zhang, L. and Muppala, J.K. and Chanson, S. T.}, TITLE = {Integrated Location Management and Location-aided Routing

System for Mobile Ad Hoc Networks},

JOURNAL = {Journal of Parallel and Distributed Computing}, YEAR = {2006}, VOLUME = {66}, NUMBER = {3}, PAGES = {367--378}, MONTH = {March}}

@InProceedings{ZhangSZC05, AUTHOR = {Wensheng Zhang and Hui Song and Sencun Zhu and Guohong

Cao}, TITLE = {Least Privilege and Privilege Deprivation: {T}owards

Tolerating Mobile Sink Compromises in Wireless Sensor Networks},

BOOKTITLE = {Proceedings of the $6$th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2005},

YEAR = {2005}, ISBN = {1-59593-004-3}, PAGES = {378--389}, ADDRESS = {Urbana-Champaign, IL, USA}, DOI = {http://doi.acm.org/10.1145/1062689.1062737}, PUBLISHER= {ACM}, MONTH = {May 25--28}}

@InProceedings{ZhaoAZ04, AUTHOR = {Zhao, W. and Ammar, M. H. and Zegura, E. W.}, TITLE = {A Message Ferrying Approach for Data Delivery in Sparse

Mobile Ad Hoc Networks}, BOOKTITLE = {Proceedings of the $5$th ACM International Symposium on

Mobile Ad Hoc Networking and Computing, MobiHoc 2004}, PAGES = {187--198}, YEAR = {2004}, ADDRESS = {Roppongi Hills, Tokyo, Japan}, MONTH = {May 24--26}}

@InProceedings{ZhaoAZ05, AUTHOR = {Zhao, W. and Ammar, M. H. and Zegura, E. W.}, TITLE = {Controlling the Mobility of Multiple Data Transport

Ferries in a Delay-Tolerant Network}, BOOKTITLE = {Proceedings of IEEE Infocom 2005}, PAGES = {1407--1418}, YEAR = {2005}, VOLUME = {2}, ADDRESS = {Miami, FL},

MONTH = {March 13--17}}

@Book{ZhaoG04, AUTHOR = {Zhao, F. and Guibas, L.}, TITLE = {Wireless Sensor Networks, An Information Processing

Approach}, PUBLISHER= {Morgan Kaufmann}, YEAR = {2004}, SERIES = {Networking}, ADDRESS = {San Francisco, CA}, MONTH = {January}}

@Misc{ZhouH99, AUTHOR = {L. Zhou and Z. Haas}, TITLE = {Securing Ad Hoc Networks}, TEXT = {L. Zhou and Z. J. Haas. Securing Ad Hoc Networks. IEEE

Network Magazine, vol. 13, no.6, November/December 1999.}, YEAR = {1999}, URL = {citeseer.nj.nec.com/zhou99securing.html}}

@InProceedings{ZhuC98, AUTHOR = {Zhu, C. and Corson, S. M.}, TITLE = {A Five-Phase Reservation Protocol ({FPRP}) for Mobile Ad

Hoc Networks}, BOOKTITLE = {Proceedings of IEEE Infocom'98}, PAGES = {322-331}, YEAR = {1998}, VOLUME = {1}, ADDRESS = {San Francisco, CA}, MONTH = {March/April}}

@InProceedings{ZivianiFRD02, AUTHOR = {Ziviani, A. and Fdida, S. and {de Rezende}, J. F. and

Duarte, O. C. M. B.}, TITLE = {Enhancing Location Management in Mobile Ad Hoc Networks}, BOOKTITLE = {Proceedings of the First IFIP Mediterranean Ad Hoc

Networking Workshop, Med-Hoc-Net 2002}, YEAR = {2002}, ADDRESS = {Sardinia, Italy}, MONTH = {September 4--6}}

@InProceedings{ZivianiFRD99, AUTHOR = "Artur Ziviani and Serge Fdida and Jos\'{e} Ferreira de

Rezende and Otto Carlos Muniz Bandeira Duarte", TITLE = "Enhancing Location Management in Mobile Ad Hoc Networks", BOOKTITLE = "Proc. of the IFIP Mediterranean Ad Hoc Networking Workshop

- Med-Hoc-Net 2002", ADDRESS = "Sardinia, Italy", MONTH = SEP, YEAR = 2002}

@Article{ZorziR03a, AUTHOR = {Zorzi, M. and Rao, R. R.}, TITLE = {Geographic Random Forwarding ({GeRaF}) for Ad Hoc and

Sensor Networks: Multihop Performance}, JOURNAL = {IEEE Transactions on Mobile Computing}, YEAR = {2003}, VOLUME = {2}, NUMBER = {4}, PAGES = {337--348}, MONTH = {October-December}}

@Article{ZorziR03b, AUTHOR = {Zorzi, M. and Rao, R. R.}, TITLE = {Geographic Random Forwarding ({GeRaF}) for Ad Hoc and

Sensor Networks: Energy and Latency Performance}, JOURNAL = {IEEE Transactions on Mobile Computing}, YEAR = {2003}, VOLUME = {2}, NUMBER = {4}, PAGES = {349--365}, MONTH = {October-December}}

@Article{ZorziR99, AUTHOR = {Zorzi, M. and Rao, R. R.}, TITLE = {Perspectives on the Impact of Error Statistics on

Protocols for Wireless Networks}, JOURNAL = {IEEE Personal Communications}, YEAR = {1999}, VOLUME = {6}, NUMBER = {5}, PAGES = {32--40},

MONTH = {October}}

@Article{ZouLX05, AUTHOR = {Zou, L. and Lu, M. and Xiong, Z.}, TITLE = {A Distributed Algorithm for the Dead End Problem of

Location Based Routing in Sensor Networks}, JOURNAL = {IEEE Transactions on Vehicular Technology}, YEAR = {2005}, VOLUME = {54}, NUMBER = {4}, PAGES = {1509--1522}, MONTH = {July}}