@article{abramson1985development,
	author = {Abramson, Norman},
	title = {{Development of the ALOHANET}},
	journal = {IEEE Transactions on Information Theory},
	pages = {119-123},
	volume = {31},
	number = {2},
	year = {1985},
	month = {March},
}
@inproceedings{adamou2001energy,
	author = {Adamou, Maria and Lee, Insup and Shin, Insik},
	title = {{An energy efficient real-time medium access control protocol for wireless ad-hoc networks}},
	booktitle = {22nd IEEE Real-Time Systems Symposium (RTSS 2001), WIP-Session},
	year = {2001},
	address = {London, UK},
	abstract = {This paper presents the design and analysis of an energy ef-
ficient real-time Medium Access Control (MAC) protocol for
wireless ad-hoc networks. We propose a fully distributed reservation
scheme to provide bandwidth guarantees to real-time sessions
as well as significant energy savings, taking advantage of
location information of the nodes. In this paper, we describe the
protocol and present the correctness proof.},
}
@article{adleman1994molecular,
	author = {Adleman, Leonard M.},
	title = {{Molecular computation of solutions to combinatorial problems}},
	journal = {Science},
	pages = {1021-1024},
	volume = {226},
	number = {11},
	year = {1994},
	month = {November},
}
@inproceedings{agarwal2000route-lifetime,
	author = {Agarwal, Sulabh and Ahuja, Ashish and Singh, Jatinder Pal and Shorey, Rajeev},
	title = {{Route-Lifetime Assessment Based Routing (RABR) Protocol for Mobile Ad-Hoc Networks}},
	booktitle = {IEEE International Conference on Communications (IEEE ICC 2001)},
	pages = {1697-1701},
	volume = {3},
	year = {2000},
	month = {June},
	address = {New Orleans, LA, USA},
}
@article{akan2005event-to-sink,
	author = {Akan, \"{O}zg\"{u}r B. and Akyildiz, Ian F.},
	title = {{Event-to-Sink Reliable Transport in Wireless Sensor Networks}},
	journal = {IEEE/ACM Transactions on Networking (TON)},
	pages = {1003-1016},
	volume = {13},
	number = {5},
	year = {2005},
	month = {October},
}
@article{akkaya2004energy-aware,
	author = {Akkaya, Kemal and Younis, Mohamed},
	title = {{Energy-aware routing of time-constrained traffic in wireless sensor networks}},
	journal = {Journal of Communication Systems, Special Issue on Service Differentiation and QoS in Ad Hoc Networks},
	pages = {663-687},
	volume = {17},
	number = {6},
	year = {2004},
}
@article{akkaya2005survey,
	author = {Akkaya, Kemal and Younis, Mohamed},
	title = {{A Survey of Routing Protocols in Wireless Sensor Networks}},
	journal = {Elsevier Ad Hoc Networks},
	pages = {325-349},
	volume = {3},
	number = {3},
	year = {2005},
}
@article{akyildiz2004wireless,
	author = {Akyildiz, Ian F. and Kasimoglu, Ismail H.},
	title = {{Wireless Sensor and Actor Networks: Research Challenges}},
	journal = {Elsevier Ad Hoc Networks},
	pages = {351-367},
	volume = {2},
	year = {2004},
	month = {October},
}
@article{akyildiz2005underwater,
	author = {Akyildiz, Ian F. and Pompili, Dario and Melodia, Tommaso},
	title = {{Underwater acoustic sensor networks: research challenges}},
	journal = {Elsevier Ad Hoc Networks},
	pages = {257-279},
	volume = {3},
	number = {3},
	year = {2005},
	month = {May},
}
@article{akyildiz2002wireless,
	author = {Akyildiz, Ian F. and Su, Weilian and Sankarasubramaniam, Yogesh and Cayirci, Erdal},
	title = {{Wireless sensor networks: a survey}},
	journal = {Elsevier Computer Networks},
	pages = {393-422},
	volume = {38},
	year = {2002},
}
@article{akyildiz2002survey,
	author = {Akyildiz, Ian F. and Su, Weilian and Sankarasubramaniam, Yogesh and Cayirci, Erdal},
	title = {{A Survey on Sensor Networks}},
	journal = {IEEE Communications Magazine},
	pages = {102-116},
	volume = {40},
	number = {8},
	year = {2002},
	month = {August},
	abstract = {Recent advancement in wireless communications
and electronics has enabled the development
of low-cost sensor networks. The sensor
networks can be used for various application
areas (e.g., health, military, home). For different
application areas, there are different technical
issues that researchers are currently resolving.
The current state of the art of sensor networks is
captured in this article, where solutions are discussed
under their related protocol stack layer
sections. This article also points out the open
research issues and intends to spark new interests
and developments in this field.},
}
@article{akyildiz2005survey,
	author = {Akyildiz, Ian F. and Wang, Xudong},
	title = {{A Survey on Wireless Mesh Networks}},
	journal = {IEEE Communications Magazine},
	pages = {S23-S30},
	volume = {43},
	number = {9},
	year = {2005},
	month = {September},
}
@article{akyildiz2005wireless,
	author = {Akyildiz, Ian F. and Wang, Xudong and Wang, Weilin},
	title = {{Wireless mesh networks: a survey}},
	journal = {Elsevier Computer Networks},
	pages = {445-487},
	volume = {47},
	number = {4},
	year = {2005},
	month = {March},
}
@inproceedings{alenius2004experiments,
	author = {Alenius, Emma and Eide, Age J. and Johansson, Jan and Johansson, Jimmy and Land, Johan and Lindblad, Thomas},
	title = {{Experiments on Clustering using Swarm Intelligence and Collective Behavior}},
	booktitle = {International IPSI-2004 Stockholm Conference: Symposium on Challenges in the Internet and Interdisciplinary Research (IPSI-2004 Stockholm)},
	year = {2004},
	month = {September},
	address = {Stockholm, Sweden},
}
@article{allen1983maintaining,
	author = {Allen, J. F.},
	title = {{Maintaining Knowledge about Temporal Intervals}},
	journal = {Communications of the ACM},
	pages = {832-843},
	volume = {26},
	number = {11},
	year = {1983},
	month = {November},
}
@article{anantharaman2004tcp,
	author = {Anantharaman, Vaidyanathan and Park, Seung-Jong and Sundaresan, Karthikeyan and Sivakumar, Raghupathy},
	title = {{TCP performance over mobile ad hoc networks: a quantitative study}},
	journal = {Wireless Communications and Mobile Computing},
	pages = {203-222},
	volume = {4},
	number = {2},
	year = {2004},
	month = {March},
}
@inproceedings{anastasi2004performance,
	author = {Anastasi, G. and Conti, M. and Gregori, E. and Falchi, A. and Passarella, A.},
	title = {{Performance Measurements of Mote Sensor Networks}},
	booktitle = {7th ACM International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (ACM MSWiM 2004)},
	year = {2004},
	month = {October},
	address = {Venice, Italy},
}
@inproceedings{andersen2001resilient,
	author = {Andersen, David and Balakrishnan, Hari and Kaashoek, Frans and Morris, Robert},
	title = {{Resilient Overlay Networks}},
	booktitle = {18th ACM Symposium on Operating Systems Principles (SOSP)},
	pages = {131-145},
	year = {2001},
	month = {October},
	address = {Banff, Canada},
}
@article{arai2002advances,
	author = {Arai, Tamio and Pagello, Enrico and Parker, Lynne E.},
	title = {{Editorial: Advances in Multi-Robot Systems}},
	journal = {IEEE Transactions on Robotics and Automation},
	pages = {655-661},
	volume = {18},
	number = {5},
	year = {2002},
	month = {October},
}
@article{arthur1999complexity,
	author = {Arthur, W. Brian},
	title = {{Complexity and the Economy}},
	journal = {Science},
	pages = {107-109},
	volume = {284},
	number = {5411},
	year = {1999},
	month = {April},
}
@inproceedings{arvind1989new,
	author = {Arvind, K.},
	title = {{A new probabilistic algorithm for clock synchronization}},
	booktitle = {Real Time Systems Symposium},
	pages = {330-339},
	year = {1989},
	month = {December},
	address = {Santa Monica, CA, USA},
}
@article{awerbuch1985complexity,
	author = {Awerbuch, Baruch},
	title = {{Complexity of network synchronization}},
	journal = {Journal of the ACM (JACM)},
	pages = {804-823},
	volume = {32},
	number = {4},
	year = {1985},
	month = {October},
}
@inproceedings{baggio2005wireless,
	author = {Baggio, Aline},
	title = {{Wireless sensor networks in precision agriculture}},
	booktitle = {ACM Workshop on Real-World Wireless Sensor Networks (REALWSN 2005)},
	year = {2005},
	month = {June},
	address = {Stockholm, Sweden},
}
@incollection{bai2004survey,
	author = {Bai, Fan and Helmy, Ahmed},
	title = {{A Survey of Mobility Models in Wireless Adhoc Networks}},
	booktitle = {Wireless Ad Hoc and Sensor Networks},
	keywords = {mobility model, Mobile Ad hoc Network},
	year = {2004},
	publisher = {Kluwer Academic Publishers},
	abstract = {A Mobile Ad hoc NETwork (MANET) is a collection of wireless mobile nodes forming a self-configuring network without using any existing infrastructure. Since MANETs are not currently deployed on a large scale, research in this area is mostly simulation based. Among other simulation parameters, the mobility model plays a very important role in determining the protocol performance in MANET. Thus, it is essential to study and analyze various mobility models and their effect on MANET protocols. In this chapter, we survey and examine different mobility models proposed in the recent research literature. Beside the commonly used Random Waypoint model and its variants, we also discuss various models that exhibit the characteristics of temporal dependency, spatial dependency and geographic constraint. Hence, we attempt to provide an overview of the current research status of mobility modeling and analysis.},
}
@inproceedings{bai2006deploying,
	author = {Bai, Xiaole and Kumary, Santosh and Xuany, Dong and Yunz, Ziqiu and Lai, Ten H.},
	title = {{Deploying Wireless Sensors to Achieve Both Coverage and Connectivity}},
	booktitle = {7th ACM International Symposium on Mobile Ad Hoc Networking and Computing (ACM Mobihoc 2006)},
	pages = {131-142},
	year = {2006},
	month = {May},
	address = {Florence, Italy},
}
@inproceedings{banerjee2001clustering,
	author = {Banerjee, Suman and Khuller, Samir},
	title = {{A Clustering Scheme for Hierarchical Control in Multi-hop Wireless Networks}},
	booktitle = {20th IEEE Conference on Computer Communications (IEEE INFOCOM 2001)},
	year = {2001},
	month = {April},
	address = {Anchorage, Alaska, USA},
	abstract = {In this paper we present a clustering scheme to create a hierarchical control 
structure for multi-hop wireless networks. A cluster is defined as a subset of 
vertices, whose induced graph is connected. In addition, a cluster is required 
to obey certain constraints that are useful for management and scalability of 
the hierarchy. All these constraints cannot be met simultaneously for general 
graphs, but we show how such a clustering can be obtained for wireless 
network topologies. Finally, we present an efficient distributed implementation 
of our clustering algorithm for a set of wireless nodes to create the set of 
desired clusters.},
}
@inproceedings{barrett2003parametric,
	author = {Barrett, Christopher L. and Eidenbenz, Stephan J. and Kroc, Lukas},
	title = {{Parametric Probabilistic Sensor Network Routing}},
	booktitle = {9th ACM International Conference on Mobile Computing and Networking (ACM MobiCom 2003)},
	keywords = {Sensor Networks, Probabilistic Routing, Simulation},
	year = {2003},
	address = {San Diego, CA, USA},
	abstract = {Motivated by realistic sensor network scenarios that have misinformed nodes and variable network topologies, we propose a fundamentally different approach to routing that combines the best features of limited-flooding and information-sensitive path-finding protocols into a reliable, low-power method that can make delivery guarantees independent of parameter values or information noise levels. We introduce Parametric Probabilistic Sensor Network Routing Protocols, a family of light-weight and robust multi-path routing protocols for sensor networks in which an intermediate sensor decides to forward a message with a probability that depends on various parameters, such as the distance of the sensor to the destination, the distance of the source sensor to the destination, or the number of hops a packet has already traveled. We propose two protocol variants of this family and compare the new methods to other probabilistic and deterministic protocols, namely constant-probability gossiping, uncontrolled flooding, random wandering, shortest path routing (and a variation), and a load-spreading shortest-path protocol inspired by [Servetto, Barrenechea, 2002]. We consider sensor networks where a sensor's knowledge of the local or global information is uncertain (parametrically noised) due to sensor mobility, and investigate the trade-off between robustness of the protocol as measured by quality of service (in particular, successful delivery rate and delivery lag) and use of resources (total network load). Our results show that the multi-path protocols are less sensitive to misinformation, and suggest that in the presence of noisy data, a limited flooding strategy will actually perform better and use fewer resources than an attempted single-path routing strategy, with the Parametric Probabilistic Sensor Network Routing Protocols outperforming other protocols. Our results also suggest that protocols using network information perform better than protocols that do not, even in the presence of strong noise.},
}
@techreport{barsukov2004challenges,
	author = {Barsukov, Yevgen},
	title = {{Challenges and Solutions in Battery Fuel Gauging}},
	year = {2004},
	institution = {Texas Instruments},
	type = {Workbook},
	url = {http://focus.ti.com/lit/ml/slyp086/slyp086.pdf},
}
@inproceedings{batalin2002sensor,
	author = {Batalin, Maxim A. and Sukhatme, Gaurav S.},
	title = {{Sensor Coverage using Mobile Robots and Stationary Nodes}},
	booktitle = {SPIE 2002},
	pages = {269-276},
	volume = {4868},
	year = {2002},
	month = {August},
	address = {Boston, MA, USA},
}
@inproceedings{batalin2003using,
	author = {Batalin, Maxim A. and Sukhatme, Gaurav S.},
	title = {{Using a Sensor Network for Distributed Multi-Robot Task Allocation}},
	booktitle = {IEEE International Conference on Robotics and Automation},
	pages = {158-164},
	year = {2003},
	month = {May},
	address = {New Orleans, LA, USA},
}
@inproceedings{batalin2003coverage,
	author = {Batalin, Maxim A. and Sukhatme, Gaurav S.},
	title = {{Coverage, Exploration and Deployment by a Mobile Robot and Communication Network}},
	booktitle = {International Workshop on Information Processing in Sensor Networks},
	pages = {376-391},
	year = {2003},
	month = {April},
	address = {Palo Alto, USA},
}
@inproceedings{batalin2003sensor,
	author = {Batalin, Maxim A. and Sukhatme, Gaurav S.},
	title = {{Sensor Network-based Multi-Robot Task Allocation}},
	booktitle = {IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003)},
	pages = {1939-1944},
	year = {2003},
	month = {October},
	address = {Las Vegas, Nevada},
}
@inproceedings{beckwith2004report,
	author = {Beckwith, R. and Teibel, D. and Bowen, P.},
	title = {{Report from the field: results from an agricultural wireless sensor}},
	booktitle = {29th IEEE International Conference on Local Computer Networks (LCN)},
	pages = {471-478},
	year = {2004},
	month = {November},
	abstract = {This paper reports the results of a 6-month deployment of a 65-node multi-hop network in a vineyard setting. This deployment specifically looked to discover ways in which a farm setting could find a return on investment for deploying such a network. Our ongoing collaborations of over two years ultimately have included everyone from the vineyard owners to the technology developers. We have been able to find several areas where wireless sensor networks deliver valuable information and provide a return on investment.},
}
@inproceedings{bellur1999reliable,
	author = {Bellur, Bhargav and Ogier, Richard G.},
	title = {{A Reliable, Efficient Topology Broadcast Protocol for Dynamic Networks}},
	booktitle = {18th IEEE Conference on Computer Communications (IEEE INFOCOM 1999)},
	pages = {178-186},
	volume = {1},
	keywords = {Topology broadcast, link-state routing, reversepath forwarding, mobile network packet-radio network},
	year = {1999},
	month = {March},
	address = {New York, NY},
	abstract = {Wepresent,provecorrectnessfor, and evaluate a protocol
for the reliable broadcast of topology and link-state information in a mnltihop
communication network with a dynamic topology, such as a wireless
network with mobile nodes. The protocol is railed Topology Broadcast
based on Reverse Path Forwarding (TBRPF), and uses the concept of
revers~path forwarding (RPF) to broadcast tink-state updates in the reverse
dkection along the spanning tree formed by the minimum-hop paths
from all nodes to the source of the npdate. TBRPF uses the topology information
reeeived along the broadcast trees to compnte the minimum-hop
paths that form the trees themselves, and is the first topology broadcast
protocol based on RPF with this property. The nse of minimnm-hop trees
instead of shortest-path trees (based on link costs) results in less frequent
changes to the broadcast trees and therefore less communication cost to
maintain the trees. Simulations show that TBRPF achieves np to a 98°/0
reduction in communication cost compared to floodlng in a 20-nodenetwork.},
}
@techreport{berkhin2002survey,
	author = {Berkhin, Pavel},
	title = {{Survey Of Clustering Data Mining Techniques}},
	year = {2002},
	institution = {Accrue Software, Inc.},
	type = {Technical Report},
}
@article{bettstetter2001mobility,
	author = {Bettstetter, Christian},
	title = {{Mobility Modeling in Wireless Networks: Categorization, Smooth Movement, and Border Effects}},
	journal = {ACM Mobile Computing and Communications Review},
	pages = {55-67},
	volume = {5},
	number = {3},
	year = {2001},
	month = {July},
}
@inproceedings{bharghavan1994macaw,
	author = {Bharghavan, Vaduvur and Demers, Alan and Shenker, Scott and Zhang, Lixia},
	title = {{MACAW: A Media Access Protocol for Wireless LAN's}},
	booktitle = {ACM SIGCOMM 1994},
	pages = {212-225},
	year = {1994},
	month = {September},
	address = {London, UK},
}
@inproceedings{bhatt2003impact,
	author = {Bhatt, Megh and Chokshi, Ronak and Desai, Swapneel and Panichpapiboon, Sooksan and Wisitpongphan, Nawaporn and Tonguz, Ozan K.},
	title = {{Impact of Mobility on the Performance of Ad Hoc Wireless Networks}},
	booktitle = {58th IEEE Vehicular Technology Conference (VTC2003-Fall)},
	pages = {3025-3029},
	volume = {5},
	year = {2003},
	address = {Orlando USA},
}
@article{birman1999bimodal,
	author = {Birman, Kenneth P. and Hayden, Mark and Ozkasap, Oznur and Xiao, Zhen and Budiu, Mihai and Minsky, Yaron},
	title = {{Bimodal Multicast}},
	journal = {ACM Transactions on Computer Systems},
	pages = {41-88},
	volume = {17},
	number = {2},
	year = {1999},
	month = {May},
}
@inproceedings{blough2002investigating,
	author = {Blough, Douglas M. and Santi, Paolo},
	title = {{Investigating upper bounds on network lifetime extension for cell-based energy conservation techniques in stationary ad hoc networks}},
	booktitle = {8th ACM International Conference on Mobile Computing and Networking (ACM MobiCom 2002)},
	pages = {183-192},
	keywords = {cooperative strategies, energy conservation, network lifetime, occupancy theory, wireless ad hoc networks},
	year = {2002},
	month = {September},
	address = {Atlanta, Georgia, USA},
	abstract = {Cooperative cell-based strategies have been recently proposed as a technique for extending the lifetime of wireless ad hoc networks, while only slightly impacting network performance. The effectiveness of this approach depends heavily on the node density: the higher it is, the more consistent energy savings can potentially be achieved. However, no general analyses of network lifetime have been done either for a base network (one without any energy conservation technique) or for one using cooperative energy conservation strategies. In this paper, we investigate the lifetime/density tradeoff under the hypothesis that nodes are distributed uniformly at random in a given region, and that the traffic is evenly distributed across the network. We also analyze the case where the node density is just sufficient to ensure that the network is connected with high probability. This analysis, which is supported by the results of extensive simulations, shows that even in this low density scenario, cell-based strategies can significantly extend network lifetime.},
}
@article{blum2004challenges,
	author = {Blum, Jeremy J. and Eskandarian, Azim and Hoffman, Lance J.},
	title = {{Challenges of Intervehicle Ad Hoc Networks}},
	journal = {IEEE Transactions on Intelligent Transportation Systems},
	pages = {347-351},
	volume = {5},
	number = {4},
	year = {2004},
	month = {December},
}
@inproceedings{bokareva2004performance,
	author = {Bokareva, Tatiana and Bulusu, Nirupama and Jha, Sanjay},
	title = {{A Performance Comparison of Data Dissemination Protocols for Wireless Sensor Networks}},
	booktitle = {IEEE Globecom Wireless Ad Hoc and Sensor Networks Workshop},
	year = {2004},
}
@incollection{boukerche2004protocols,
	author = {Boukerche, Azzedine and Nikoletseas, Sotiris},
	editor = {Guizani, Mohsen},
	title = {{Protocols for Data Propagation in Wireless Sensor Networks: A Survey}},
	booktitle = {Wireless Communications Systems and Networks},
	year = {2004},
	publisher = {Kluwer Academic Publishers},
	abstract = {Robustness is crucial for any robot team, especially
when operating in dynamic environments. The physicality of
robotic systems and their interactions with the environment
make them highly prone to malfunctions of many kinds. Three
principal categories in the possible space of robot malfunctions
are communication failures, partial failure of robot resources
necessary for task execution (or partial robot malfunction), and
complete robot failure (or robot death). This paper addresses
these three categories and explores means by which the
TraderBots approach ensures robustness and promotes graceful
degradation in team performance when faced with malfunctions.},
}
@inproceedings{boulis2003aggregation,
	author = {Boulis, Athanassios and Ganeriwal, Saurabh and Srivastava, Mani B.},
	title = {{Aggregation in Sensor Networks: An Energy-Accuracy Trade-off}},
	booktitle = {IEEE Workshop on Sensor Network Protocols and Applications (SNPA 2003)},
	pages = {128-138},
	year = {2003},
	month = {May},
}
@article{boulis2003aggregation2,
	author = {Boulis, Athanassios and Ganeriwal, Saurabh and Srivastava, Mani B.},
	title = {{Aggregation in Sensor Networks: An Energy-Accuracy Trade-off}},
	journal = {Elsevier Ad Hoc Networks},
	pages = {317-331},
	volume = {1},
	year = {2003},
}
@inproceedings{braginsky2002rumor,
	author = {Braginsky, David and Estrin, Deborah},
	title = {{Rumor Routing Algorithm For Sensor Networks}},
	booktitle = {First Workshop on Sensor Networks and Applications (WSNA)},
	keywords = {SensorNets, Wireless, Routing},
	year = {2002},
	month = {September},
	address = {Atlanta, Georgia, USA},
	abstract = {Advances in micro-sensor and radio technology will enable small
but smart sensors to be deployed for a wide range of
environmental monitoring applications. In order to constrain
communication overhead, dense sensor networks call for new and
highly efficient methods for distributing queries to nodes that
have observed interesting events in the network. A highly efficient
data-centric routing mechanism will offer significant power cost
reductions [17], and improve network longevity. Moreover,
because of the large amount of system and data redundancy
possible, data becomes disassociated from specific node and
resides in regions of the network [10][7][8]. This paper describes
and evaluates through simulation a scheme we call Rumor
Routing, which allows for queries to be delivered to events in the
network. Rumor Routing is tunable, and allows for tradeoffs
between setup overhead and delivery reliability. It’s intended for
contexts in which geographic routing criteria are not applicable
because a coordinate system is not available or the phenomenon
of interest is not geographically correlated.},
}
@article{broadbent1957percolation,
	author = {Broadbent, S.R. and Hammersley, J.M},
	title = {{Percolation processes I. Crystals and mazes}},
	journal = {Proceedings of the Cambridge Philosophical Society},
	pages = {629-641},
	volume = {53},
	year = {1957},
}
@inproceedings{brooks2003distributed,
	author = {Brooks, Richard R. and Piretti, M. and Zhu, M. and Iyengar, S. S.},
	title = {{Distributed Adaptation Methods for Wireless Sensor Networks}},
	booktitle = {IEEE Global Telecommunications Conference (IEEE GLOBECOM 2003)},
	pages = {2967-2971},
	volume = {5},
	year = {2003},
	month = {December},
	address = {San Francisco, CA},
}
@inproceedings{brooks2003emergent,
	author = {Brooks, Richard R. and Piretti, M. and Zhu, M. and Iyengar, S. S.},
	title = {{Emergent Routing Protocols in Wireless Ad Hoc Sensor Networks}},
	booktitle = {SPIE Conference},
	pages = {155-163},
	volume = {5205},
	year = {2003},
	month = {August},
}
@inproceedings{bulusu2001scalable,
	author = {Bulusu, Nirupama and Estrin, Deborah and Girod, Lewis and Heidemann, John},
	title = {{Scalable Coodination for Wireless Sensor Networks: Self-Configuring Localization Systems}},
	booktitle = {6th International Symposium on Communication Theory and Applications (ISCTA'01)},
	year = {2001},
	month = {July},
	address = {Ambleside, Lake District, UK},
}
@article{burrell2004vineyard,
	author = {Burrell, J. and Brooke, T. and Beckwith, R.},
	title = {{Vineyard computing: sensor networks in agricultural production}},
	journal = {Pervasive Computing},
	pages = {38-45},
	volume = {3},
	number = {1},
	year = {2004},
	month = {January-March},
	abstract = {Using ethnographic research methods, the authors studied the structure of the needs and priorities of people working in a vineyard to gain a better understanding of the potential for sensor networks in agriculture. We discuss an extended study of vineyard workers and their work practices to assess the potential for sensor network systems to aid work in this environment. The major purpose is to find new directions and new topics that pervasive computing and sensor networks might address in designing technologies to support a broader range of users and activities.},
}
@article{buttyan2003stimulating,
	author = {Butty\'{a}n, Levente and Hubaux, Jean-Pierre},
	title = {{Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks}},
	journal = {Mobile Networks and Applications},
	pages = {579-592},
	volume = {8},
	number = {5},
	year = {2003},
	month = {October},
}
@inproceedings{cai2005leveraging,
	author = {Cai, Ying and Hua, Kien A. and Phillips, Aaron},
	title = {{Leveraging 1-hop Neighborhood Knowledge for Efficient Flooding in Wireless Ad Hoc Networks}},
	booktitle = {International Performance, Computing, and Communication Conference (IPCCC'05)},
	pages = {347-354},
	year = {2005},
	month = {April},
	address = {Phoenix, AZ},
}
@article{camp2002survey,
	author = {Camp, Tracy and Boleng, Jeff and Davies, Vanessa},
	title = {{A Survey of Mobility Models for Ad Hoc Network Research}},
	journal = {Wireless Communications and Mobile Computing, Special Issue on Mobile Ad Hoc Networking: Research, Trends and Applications},
	pages = {483-502},
	volume = {2},
	number = {5},
	year = {2002},
}
@article{capkun2003self-organized,
	author = {Capkun, Srdjan and Butty\'{a}n, Levente and Hubaux, Jean-Pierre},
	title = {{Self-Organized Public-Key Management for Mobile Ad Hoc Networks}},
	journal = {IEEE Transactions on Mobile Computing},
	pages = {52-64},
	volume = {2},
	number = {1},
	year = {2003},
	month = {January},
}
@incollection{cardei2004coverage,
	author = {Cardei, Mihaela and Wu, Jie},
	editor = {Ilyas, M.},
	title = {{Coverage in Wireless Sensor Networks}},
	booktitle = {Handbook of Sensor Networks},
	year = {2004},
	address = {West Palm Beach, FL, USA},
	publisher = {CRC Press},
}
@inproceedings{caruso2005gps-free,
	author = {Caruso, Antonio and Chessa, Stefano and De, Swades and Urpi, Alessandro},
	title = {{GPS Free Coordinate Assignment and Routing in Wireless Sensor Networks}},
	booktitle = {24th IEEE Conference on Computer Communications (IEEE INFOCOM 2005)},
	year = {2005},
	month = {March},
	address = {Miami, FL, USA},
}
@techreport{cerpa2003scale,
	author = {Cerpa, Alberto and Busek, Naim and Estrin, Deborah},
	title = {{SCALE: A Tool for Simple Connectivity Assessment in Lossy Environments}},
	year = {2003},
	month = {September},
	institution = {UCLA Center for Embedded Network Sensing (CENS)},
	number = {0021},
	type = {Technical Report},
}
@inproceedings{cerpa2002ascent,
	author = {Cerpa, Alberto and Estrin, Deborah},
	title = {{ASCENT: Adaptive Self-Configuring sEnsor Networks Topologies}},
	booktitle = {21st IEEE Conference on Computer Communications (IEEE INFOCOM 2002)},
	year = {2002},
	month = {June},
	address = {New York, NY, USA},
}
@article{cerpa2004ascent,
	author = {Cerpa, Alberto and Estrin, Deborah},
	title = {{ASCENT: adaptive self-configuring sensor networks topologies}},
	journal = {IEEE Transactions on Mobile Computing},
	pages = {272-285},
	volume = {3},
	number = {3},
	keywords = {Wireless sensor networks, adaptive topology, energy conservation, topology control},
	year = {2004},
	month = {July/August},
	abstract = {Advances in microsensor and radio technology enable small but smart sensors to be deployed for a wide range of environmental monitoring applications. The low-per node cost allows these wireless networks of sensors and actuators to be densely distributed. The nodes in these dense networks coordinate to perform the distributed sensing and actuation tasks. Moreover, as described in this paper, the nodes can also coordinate to exploit the redundancy provided by high density so as to extend overall system lifetime. The large number of nodes deployed in this systems preclude manual configuration, and the environmental dynamics precludes design-time preconfiguration. Therefore, nodes have to self-configure to establish a topology that provides communication under stringent energy constraints. ASCENT builds on the notion that, as density increases, only a subset of the nodes is necessary to establish a routing forwarding backbone. In ASCENT, each node assesses its connectivity and adapts its participation in the multihop network topology based on the measured operating region. This paper motivates and describes the ASCENT algorithm and presents analysis, simulation, and experimental measurements. We show that the system achieves linear increase in energy savings as a function of the density and the convergence time required in case of node failures while still providing adequate connectivity.},
}
@inproceedings{chakeres2004aodv,
	author = {Chakeres, Ian and Royer, Elizabeth M.},
	title = {{AODV Routing Protocol Implementation Design}},
	booktitle = {International Workshop on Wireless Ad Hoc Networking (WWAN)},
	year = {2004},
	month = {March},
	address = {Tokyo, Japan},
}
@article{chakeres2006mobile,
	author = {Chakeres, Ian and Macker, Joseph P.},
	title = {{Mobile ad hoc networking and the IETF}},
	journal = {ACM SIGMOBILE Mobile Computing and Communications Review},
	pages = {58-60},
	volume = {10},
	number = {1},
	year = {2006},
	month = {January},
}
@article{chakrabarti2004quality,
	author = {Chakrabarti, Satyabrata and Mishra, Amitabh},
	title = {{Quality of service challenges for wireless mobile ad hoc networks}},
	journal = {Wireless Communications and Mobile Computing},
	pages = {129-153},
	volume = {4},
	number = {2},
	year = {2004},
	month = {March},
}
@article{chandy1985distributed,
	author = {Chandy, K. Mani and Lamport, Leslie},
	title = {{Distributed Snapshots: Determining Global States of Distributed Systems}},
	journal = {ACM Transactions on Computer Systems},
	pages = {63-75},
	volume = {3},
	number = {1},
	year = {1985},
	month = {February},
}
@article{chang2004maximum,
	author = {Chang, Jae-Hwan and Tassiulas, Leandros},
	title = {{Maximum Lifetime Routing in Wireless Sensor Networks}},
	journal = {IEEE/ACM Transactions on Networking (TON)},
	pages = {609-619},
	volume = {12},
	number = {4},
	year = {2004},
	month = {August},
	abstract = {A routing problem in static wireless ad hoc networks is considered as it arises in a rapidly deployed, sensor based, monitoring system known as the wireless sensor network. Information obtained by the monitoring nodes needs to be routed to a set of designated gateway nodes. In these networks, every node is capable of sensing, data processing, and communication, and operates on its limited amount of battery energy consumed mostly in transmission and reception at its radio transceiver. If we assume that the transmitter power level can be adjusted to use the minimum energy required to reach the intended next hop receiver then the energy consumption rate per unit information transmission depends on the choice of the next hop node, i.e., the routing decision. We formulate the routing problem as a linear programming problem, where the objective is to maximize the network lifetime, which is equivalent to the time until the network partition due to battery outage. Two different models are considered for the information-generation processes. One assumes constant rates and the other assumes an arbitrary process. A shortest cost path routing algorithm is proposed which uses link costs that reflect both the communication energy consumption rates and the residual energy levels at the two end nodes. The algorithm is amenable to distributed implementation. Simulation results with both information-generation process models show that the proposed algorithm can achieve network lifetime that is very close to the optimal network lifetime obtained by solving the linear programming problem.},
}
@inproceedings{chellappan2005sensor,
	author = {Chellappan, Sriram and Bai, Xiaole and Ma, Bin and Xuan, Dong},
	title = {{Sensor Networks Deployment Using Flip-Based Sensors}},
	booktitle = {2nd IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE MASS 2005)},
	year = {2005},
	month = {November},
	address = {Washington, DC},
}
@article{chen2002span,
	author = {Chen, Benjie and Jamieson, Kyle and Balakrishnan, Hari and Morris, Robert},
	title = {{Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks}},
	journal = {ACM Wireless Networks Journal},
	volume = {8},
	number = {5},
	keywords = {energy, routing, topology-formation, wireless},
	year = {2002},
	month = {September},
	abstract = {This paper presents Span, a power saving technique for multi-hop ad hoc wireless networks that reduces energy consumption without significantly diminishing the capacity or connectivity of the network. Span builds on the observation that when a region of a shared-channel wireless network has a sufficient density of nodes, only a small number of them need be on at any time to forward traffic for active connections. 

Span is a distributed, randomized algorithm where nodes make local decisions on whether to sleep, or to join a forwarding backbone as a coordinator. Each node bases its decision on an estimate of how many of its neighbors will benefit from it being awake, and the amount of energy available to it. We give a randomized algorithm where coordinators rotate with time, demonstrating how localized node decisions lead to a connected, capacity-preserving global topology. 

Improvement in system lifetime due to Span increases as the ratio of idle-to-sleep energy consumption increases. Our simulations show that with a practical energy model, system lifetime of an 802.11 network in power saving mode with Span is a factor of two better than without. Additionally, Span also improves communication latency and capacity.},
}
@incollection{chen2004clustering,
	author = {Chen, Y. P. and Liestman, A. L. and Liu, J.},
	editor = {Xiao, Y. and Pan, Y.},
	title = {{Clustering Algorithms for Ad Hoc Wireless Networks}},
	booktitle = {Ad Hoc and Sensor Networks},
	year = {2004},
	publisher = {Nova Science Publisher},
}
@article{cheyer2001open,
	author = {Cheyer, Adam and Martin, David},
	title = {{The Open Agent Architecture}},
	journal = {Journal of Autonomous Agents and Multi-Agent Systems},
	pages = {143-148},
	volume = {4},
	number = {1},
	year = {2001},
	month = {March},
}
@inproceedings{chiasserini2004modeling,
	author = {Chiasserini, Carla-Fabiana and Garetto, Michele},
	title = {{Modeling the Performance of Wireless Sensor Networks}},
	booktitle = {23rd IEEE Conference on Computer Communications (IEEE INFOCOM 2004)},
	year = {2004},
	month = {March},
	address = {Hongkong},
	abstract = {A critical issue in wireless sensor networks is
represented by the limited availability of energy within network
nodes; therefore making good use of energy is a must. A widely
employed energy-saving technique is to place nodes in sleep mode,
corresponding to a low-power consumption as well as to reduced
operational capabilities. In this work, we develop aMarkov model
of a sensor network whose nodes may enter a sleep mode, and we
use this model to investigate the system performance in terms of
energy consumption, network capacity, and data delivery delay.
Furthermore, the proposed model enables us to investigate the
trade-offs existing between these performance metrics and the
sensor dynamics in sleep/active mode. Analytical results present
an excellent matching with simulation results for a large variety
of system scenarios showing the accuracy of our approach.},
}
@article{chiasserini2001improving,
	author = {Chiasserini, Carla-Fabiana and Rao, Ramesh R.},
	title = {{Improving Battery Performance by Using Traffic Shaping Techniques}},
	journal = {IEEE Journal on Selected Areas in Communications},
	pages = {1385-1394},
	volume = {19},
	number = {7},
	year = {2001},
	month = {July},
	abstract = {We present a new approach to minimizing energy consumption by addressing battery management techniques that exploit the charge recovery effect inherent to many secondary storage batteries. We review results that pertain to the capacity of a battery and its dependence on the intensity of the discharge current. The phenomenon of charge recovery that takes place under bursty or pulsed discharge conditions is identified as a mechanism that can be exploited to enhance the capacity of a battery. The bursty nature of many data traffic sources suggests that data transmissions may provide natural opportunities for charge recovery. We explore stochastic models to track charge recovery in conjunction with bursty discharge processes. Using the postulated model, we identify the improvement to battery capacity that results from a pulsed discharge driven by bursty stochastic discharge demand. The insight from this analysis leads us to propose discharge shaping techniques that trade-off energy efficiency with delay},
}
@article{chiu2003stability,
	author = {Chiu, Chun-Yuah and Chen, Gen-Huey and Wu, Eric Hsiao-Kuang},
	title = {{A stability aware cluster routing protocol for mobile ad hoc networks}},
	journal = {Wireless Communications and Mobile Computing},
	pages = {503-515},
	volume = {3},
	number = {4},
	year = {2003},
	month = {June},
}
@techreport{choksi2002mobility,
	author = {Choksi, Ankur and Martin, Richard P. and Nath, Badri and Pupala, Rahul},
	title = {{Mobility Support for Diffusion-based Ad-Hoc Sensor Networks}},
	year = {2002},
	month = {April},
	institution = {Rutgers University, Department of Computer Science},
	number = {DCS-TR-463},
	abstract = {In this work we investigate the application of four simple
enhancements to directed diffusion to support mobile
users. The first is a small change to diffusion which
restarts path discovery when a node moves. The second
is a simple handoff scheme similar to those used in cellular
networks. The third introduces special proxy nodes
as path anchors, and the fourth scheme provides hints
to the diffusion layer to pre-create routes in an anticipated
direction of motion. We compared the behavior of
the various schemes for a mobile user tracking an object
in a sensor network under four mobility scenarios. Our
simulation results show that a combination of these simple
enhancements to diffusion permit sink speeds of up
7 meters per second without generating excessive overhead.
Increasing the transmit power was also an effective
method of reducing the impact of mobility. Finally,
we found that random motion is the most difficult mobility
scenario, so approaches shown to work under random
motion should also work well under more realistic
mobility conditions.},
	type = {Technical Report},
}
@article{chong2003sensor,
	author = {Chong, Chee-Yee and Kumar, Srikanta P.},
	title = {{Sensor Networks: Evolution, Opportunities, and Challenges}},
	journal = {Proceedings of the IEEE},
	pages = {1247-1256},
	volume = {91},
	number = {8},
	year = {2003},
	month = {August},
}
@article{chu2002scalable,
	author = {Chu, Maurice and Haussecker, Horst and Zhao, Feng},
	title = {{Scalable Information-Driven Sensor Querying and Routing for Ad Hoc Heterogeneous Sensor Networks}},
	journal = {The International Journal of High Performance Computing Applications},
	volume = {16},
	number = {3},
	year = {2002},
	abstract = {This paper describes two novel techniques,
information-driven sensor querying (IDSQ) and
constrained anisotropic diffusion routing (CADR),
for energy-efficient data querying and routing in
ad hoc sensor networks for a range of collaborative
signal processing tasks. The key idea is to
introduce an information utility measure to select
which sensors to query and to dynamically guide
data routing. This allows us to maximize information
gain while minimizing detection latency
and bandwidth consumption for tasks such as
localization and tracking. Our simulation results
have demonstrated that the information-driven
querying and routing techniques are more energy
efficient, have lower detection latency, and provide
anytime algorithms to mitigate risks of link/node
failures.},
}
@article{clarke1993asimovs,
	author = {Clarke, Roger},
	title = {{Asimov's Laws of Robotics: Implications for Information Technology - Part 1}},
	journal = {IEEE Computer},
	pages = {53-61},
	volume = {26},
	number = {12},
	year = {1993},
	month = {December},
}
@article{clarke1994asimovs,
	author = {Clarke, Roger},
	title = {{Asimov's Laws of Robotics: Implications for Information Technology - Part 2}},
	journal = {IEEE Computer},
	pages = {57-66},
	volume = {27},
	number = {1},
	year = {1994},
	month = {January},
}
@inproceedings{cramer2004demand-driven,
	author = {Cramer, C. and Stanze, O. and Weniger, K. and Zitterbart, M.},
	title = {{Demand-Driven Clustering in MANETs}},
	booktitle = {International Workshop on Mobile Ad Hoc Networks and Interoperability Issues (MANETII04)},
	year = {2004},
	address = {Las Vegas, USA},
}
@article{cristian1989probabilistic,
	author = {Cristian, F.},
	title = {{A probabilistic approach to distributed clock synchronization}},
	journal = {Distributed Computing},
	pages = {146-158},
	volume = {3},
	year = {1989},
}
@article{culler2004overview,
	author = {Culler, David and Estrin, Deborah and Srivastava, M. B.},
	title = {{Overview of Sensor Networks}},
	journal = {Computer},
	pages = {41-49},
	volume = {37},
	number = {8},
	year = {2004},
	month = {August},
}
@incollection{das2006solving,
	author = {Das, Sajal K. and Banerjee, Nilanjan and Roy, Abhishek},
	editor = {Olariu, Stephan and Zomaya, Albert Y. and Olariu, Olariu},
	title = {{Solving Otimization Problems in Wireless Networks using Genetic Algorithms}},
	booktitle = {Handbook of Bioinspired Algorithms and Applications},
	year = {2006},
	publisher = {CRC Press},
}
@article{de2003resource,
	author = {De, Swades and Qiao, Chunming and Das, Sajal K.},
	title = {{A resource-efficient QoS routing protocol for mobile ad hoc networks}},
	journal = {Wireless Communications and Mobile Computing},
	pages = {465-486},
	volume = {3},
	number = {4},
	year = {2003},
	month = {June},
}
@inproceedings{deng1998dual,
	author = {Deng, Jing and Haas, Zygmunt J.},
	title = {{Dual Busy Tone Multiple Access (DBTMA): A New Medium Access Control for Packet Radio Networks}},
	booktitle = {IEEE International Conference on Universal Personal Communications (ICUPC)},
	year = {1998},
	month = {October},
	address = {Florence, Italy},
}
@article{dewasurendra2004scalability,
	author = {Dewasurendra, Duminda and Mishra, Amitabh},
	title = {{Scalability of a scheduling scheme for energy aware sensor networks}},
	journal = {Wireless Communications and Mobile Computing},
	pages = {289-303},
	volume = {4},
	number = {3},
	year = {2004},
	month = {April},
}
@article{dicaro1998antnet,
	author = {Di Caro, Gianni and Dorigo, Marco},
	title = {{AntNet: Distributed Stigmergetic Control for Communication Networks}},
	journal = {Journal of Artificial Intelligence Research},
	pages = {317-365},
	volume = {9},
	year = {1998},
	month = {December},
}
@article{dicaro2005anthocnet,
	author = {Di Caro, Gianni and Ducatelle, Frederick and Gambardella, Luca M.},
	title = {{AntHocNet: An adaptive nature-inspired algorithm for routing in mobile ad hoc networks}},
	journal = {European Transactions on Telecommunications, Special Issue on Self-organization in Mobile Networking},
	pages = {443-455},
	volume = {16},
	year = {2005},
}
@article{dijkstra1959note,
	author = {Dijkstra, E W.},
	title = {{A Note on Two Problems in Connexion with Graphs}},
	journal = {Numerische Mathematik},
	pages = {269-271},
	volume = {1},
	year = {1959},
}
@inproceedings{ding2005localized,
	author = {Ding, Min and Chen, Dechang and Xing, Kai and Cheng, Xiuzhen},
	title = {{Localized Fault-Tolerant Event Boundary Detection in Sensor Networks}},
	booktitle = {24th IEEE Conference on Computer Communications (IEEE INFOCOM 2005)},
	year = {2005},
	month = {March},
	address = {Miami, FL, USA},
}
@inproceedings{ding2003aggregation,
	author = {Ding, Min and Cheng, Xiuzhen and Xue, Guoliang},
	title = {{Aggregation Tree Construction in Sensor Networks}},
	booktitle = {58th IEEE Vehicular Technology Conference (VTC2003-Fall)},
	pages = {2168-2172},
	volume = {4},
	year = {2003},
	month = {October},
}
@article{dorigo1999ant,
	author = {Dorigo, Marco and Di Caro, Gianni and Gambardella, Luca M.},
	title = {{Ant Algorithms for Discrete Optimization}},
	journal = {Artificial Life},
	pages = {137-172},
	volume = {5},
	number = {2},
	year = {1999},
	month = {April},
}
@article{dorigo1996ant,
	author = {Dorigo, Marco and Maniezzo, Vittorio and Colorni, Alberto},
	title = {{The Ant System: Optimization by a colony of cooperating agents}},
	journal = {IEEE Transactions on Systems, Man, and Cybernetics},
	pages = {1-13},
	volume = {26},
	number = {1},
	year = {1996},
}
@article{dorigo2004evolving,
	author = {Dorigo, Marco and Trianni, Vito and Sahin, Erol and Gro\ss, Roderich and Labella, Thomas Halva and Baldassarre, Gianluca and Nol, Stefano and Deneubourg, Jean-Louis and Mondada, Francesco and Floreano, Dario and Gambardella, Luca M.},
	title = {{Evolving Self-Organizing Behaviors for a Swarm-bot}},
	journal = {Autonomous Robots},
	pages = {223-245},
	volume = {17},
	number = {2-3},
	year = {2004},
	abstract = {In this paper, we introduce a self-assembling and self-organizing artifact,
called a swarm-bot, composed of a swarm of s-bots, mobile robots with the ability
to connect to and to disconnect from each other. We discuss the challenges
involved in controlling a swarm-bot and address the problem of synthesizing
controllers for the swarm-bot using artificial evolution. Specifically, we study
aggregation and coordinated motion of the swarm-bot using a physics-based
simulation of the system. Experiments, using a simplified simulation model of
the s-bots, show that evolution can discover simple but effective controllers for
both the aggregation and the coordinated motion of the swarm-bot. Analysis
of the evolved controllers shows that they have properties of scalability, that
is, they continue to be effective for larger group sizes, and of generality, that
is, they produce similar behaviors for configurations different from those they
were originally evolved for. The portability of the evolved controllers to real
s-bots is tested using a detailed simulation model which has been validated
against the real s-bots in a companion paper in this same special issue.},
}
@inproceedings{du2003chain-based,
	author = {Du, Kemei and Wu, Jie and Zhou, Dan},
	title = {{Chain-Based Protocols for Data Broadcasting and Gathering in the Sensor Networks}},
	booktitle = {17th IEEE International Parallel and Distributed Processing Symposium (IPDPS'03)},
	pages = {260a},
	year = {2003},
	month = {April},
}
@inproceedings{duarte-melo2002analysis,
	author = {Duarte-Melo, Enrique J. and Liu, Mingyan},
	title = {{Analysis of Energy Consumption and Lifetime of Heterogeneous Wireless Sensor Networks}},
	booktitle = {IEEE Global Telecommunications Conference (IEEE GLOBECOM 2002)},
	year = {2002},
	month = {November},
	address = {Taipei, Taiwan},
}
@inproceedings{durvy2005reaction-diffusion,
	author = {Durvy, Mathilde and Thiran, Patrick},
	title = {{Reaction-Diffusion Based Transmission Patterns for Ad Hoc Networks}},
	booktitle = {24th IEEE Conference on Computer Communications (IEEE INFOCOM 2005)},
	year = {2005},
	month = {March},
	address = {Miami, FL, USA},
}
@inproceedings{ebner2001self-organized,
	author = {Ebner, Andr\'{e} and Rohling, Hermann},
	title = {{A Self-Organized Radio Network for Automotive Applications}},
	booktitle = {8th World Congress on Intelligent Transportation Systems (ITS 2001)},
	year = {2001},
	month = {October},
	address = {Sydney, Australia},
}
@inproceedings{elson2001time,
	author = {Elson, Jeremy and Estrin, Deborah},
	title = {{Time Synchronization for Wireless Sensor Networks}},
	booktitle = {2001 International Parallel and Distributed Processing Symposium (IPDPS)},
	year = {2001},
	month = {April},
	address = {San Francisco, CA, USA},
}
@inproceedings{elson2002fine-grained,
	author = {Elson, Jeremy and Girod, Lewis and Estrin, Deborah},
	title = {{Fine-Grained Network Time Synchronization using Reference Broadcasts}},
	booktitle = {Fifth Symposium on Operating Systems Design and Implementation (OSDI 2002)},
	year = {2002},
	month = {December},
	address = {Boston, MA},
}
@article{elson2003wireless,
	author = {Elson, Jeremy and R\"{o}mer, Kay},
	title = {{Wireless Sensor Networks: A New Regime for Time Synchronization}},
	journal = {ACM Computer Communication Review (CCR)},
	pages = {149-154},
	volume = {33},
	number = {1},
	year = {2003},
	month = {January},
}
@article{erdoes1960evolution,
	author = {Erd\"{o}s, P. and R\'{e}nyi, A.},
	title = {{On the evolution of random graphs}},
	journal = {Publications of the Mathematical Institute of the Hungarian Academy of Sciences},
	pages = {17-61},
	volume = {5},
	year = {1960},
}
@article{estrin2002connecting,
	author = {Estrin, Deborah and Culler, David and Pister, Kristopher and Sukhatme, Gaurav S.},
	title = {{Connecting the Physical World with Pervasive Networks}},
	journal = {IEEE Pervasive Computing},
	pages = {59-69},
	volume = {1},
	number = {1},
	year = {2002},
	month = {January},
}
@techreport{estrin1999scalable,
	author = {Estrin, Deborah and Govindan, Ramesh and Heidemann, John},
	title = {{Scalable Coordination in Sensor Networks}},
	year = {1999},
	institution = {USC/Information Sciences Institute},
	number = {99-692},
	type = {Technical Report},
}
@inproceedings{estrin1999next,
	author = {Estrin, Deborah and Govindan, Ramesh and Heidemann, John and Kumar, Satish},
	title = {{Next Century Challenges: Scalable Coordination in Sensor Networks}},
	booktitle = {5th ACM International Conference on Mobile Computing and Networking (ACM MobiCom 1999)},
	pages = {263-270},
	year = {1999},
	month = {August},
	address = {Seattle, Washington, USA},
	publisher = {ACM},
}
@techreport{fall2003ns-manual,
	author = {Fall, Kevin and Varadhan, Kannan},
	title = {{The ns Manual}},
	year = {2003},
	month = {February},
	institution = {The VINT Project},
	url = {http://www.isi.edu/nsnam/ns/ns-documentation.html},
}
@inproceedings{fernandess2002k-clustering,
	author = {Fernandess, Yaacov and Malkhi, Dahlia},
	title = {{K-Clustering in Wireless Ad Hoc Networks}},
	booktitle = {2nd ACM Workshop on Principles of Mobile Computing},
	pages = {31-37},
	year = {2002},
	address = {Toulouse, France},
}
@inproceedings{foster2001anatomy,
	author = {Foster, Ian},
	title = {{The anatomy of the grid: enabling scalable virtual organizations}},
	booktitle = {1st IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'01)},
	pages = {6-7},
	year = {2001},
	month = {May},
}
@techreport{gage2004affective,
	author = {Gage, Aaron and Murphy, Robin and Valavanis, Kimon and Long, Matt},
	title = {{Affective Task Allocation for Distributed Multi-Robot Teams}},
	year = {2004},
	institution = {Center for Robot-Assisted Search and Rescue, University of South Florida},
	number = {CRASAR-TR2004-26},
	type = {Technical Report},
}
@inproceedings{galmes2006lifetime,
	author = {Galm\'{e}s, Sebasti\`{a}},
	title = {{Lifetime Issues in Wireless Sensor Networks for Vineyard Monitoring}},
	booktitle = {3rd IEEE International Conference on Mobile Ad Hoc and Sensor Systems (IEEE MASS 2006), Poster Session},
	pages = {542-545},
	year = {2006},
	month = {October},
	address = {Vancouver, Canada},
}
@inproceedings{ganeriwal2003timing-sync,
	author = {Ganeriwal, Saurabh and Kumar, Ram and Srivastava, Mani B.},
	title = {{Timing-sync Protocol for Sensor Networks}},
	booktitle = {1st ACM Conference on Embedded Networked Sensor Systems (ACM SenSys 2003)},
	year = {2003},
	month = {November},
	address = {Los Angeles, CA},
}
@inproceedings{garcia-luna-aceves2002flow-oriented,
	author = {Garcia-Luna-Aceves, J. J.},
	title = {{Flow-Oriented Protocols for Scalable Wireless Networks}},
	booktitle = {5th ACM International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (ACM MSWiM 2002)},
	year = {2002},
	month = {September},
	address = {Atlanta, Georgia, USA},
}
@article{garcia-molina1982elections,
	author = {Garcia-Molina, H.},
	title = {{Elections in a Distributed Computing System}},
	journal = {IEEE Transactions on Computers},
	pages = {48-59},
	volume = {31},
	number = {1},
	year = {1982},
	month = {January},
}
@inproceedings{gerhenson2003when,
	author = {Gerhenson, Carlos and Heylighen, Francis},
	title = {{When Can we Call a System Self-organizing?}},
	booktitle = {7th European Conference on Advances in Artificial Life (ECAL 2003)},
	pages = {606-614},
	year = {2003},
	month = {September},
	address = {Dortmund, Germany},
}
@phdthesis{gerkey2003multi-robot,
	author = {Gerkey, Brian Paul},
	title = {{On Multi-Robot Task Allocation}},
	pages = {117},
	year = {2003},
	month = {August},
	school = {University of Southern California},
	abstract = {Despite more than a decade of experimental work in multi-robot systems, important theoretical aspects
of multi-robot coordination mechanisms have, to date, been largely ignored. To address part of this negligence,
this dissertation focuses on the problem of multi-robot task allocation (MRTA). Most work on
MRTA has been ad hoc and empirical, with many coordination architectures having been proposed and
validated in a proof-of-concept fashion, but infrequently analyzed.
With the goal of bringing some objective grounding to this important area of research, this dissertation
presents a formal study of MRTA problems. A domain-independent taxonomy of MRTA problems is given,
and it is shown how many such problems can be viewed as instances of other, well-studied, optimization
problems. By casting MRTA problems in the well-understood framework of optimization, a half-century
of work in operations research, game theory, economics, and network flows can be adapted for use in
robotic domains. This dissertation demonstrates how such theory can be used for analysis and greater
understanding of existing approaches to task allocation, and suggests how the same theory can be used in
the synthesis of new approaches.
Although vital for the advancement of the field, analysis is only one component of a comprehensive
research agenda. Sensor-actuator systems such as robots present a rich, complex problem domain that can
exhibit significant levels of noise and uncertainty. One must implement and empirically validate proposed
MRTA algorithms. Thus this dissertation also presents experimental work with an auction-based task
allocation system, implemented on physical robots. Optimization theory is used to explain how and why
this approach is successful.
This kind of empirical work is a natural complement to formal analysis, and can serve the crucial role
of suggesting modifications to the formal model that is analyzed. Such experiments require substantial
supporting software infrastructure. This dissertation describes the underlying software facilities that were
developed for experimental use in the study of MRTA, as well as for more general use. Specifically discussed
is the Player/Stage project, which produces high-quality Open Source software to support robotics
research, with the goal of providing a standard platform for mobile robot experimentation and simulation.},
	type = {Ph.D Thesis},
}
@article{gibson2006emergence,
	author = {Gibson, Matthew C. and Patel, Ankit B. and Nagpal, Radhika and Perrimon, Norbert},
	title = {{The emergence of geometric order in proliferating metazoan epithelia}},
	journal = {Nature},
	pages = {1038-1041},
	volume = {442},
	number = {31},
	year = {2006},
	month = {August},
}
@inproceedings{giridhar2005maximizing,
	author = {Giridhar, Arvind and Kumar, P.R.},
	title = {{Maximizing the Functional Lifetime of Sensor Networks}},
	booktitle = {4th International Symposium on Information Processing in Sensor Networks (IPSN 2005)},
	year = {2005},
	month = {April},
	address = {Los Angeles, California, USA},
	abstract = {The functional lifetime of a sensor network is defined as the maximum number of times a certain data collection function or task can be carried out without any node running out of energy. The specific task considered in this paper is that of communicating a specified quantity of information from each sensor to a collector node. The problem of finding the communication scheme which maximizes functional lifetime can be formulated as a linear program, under "fluid-like" assumptions on information bits. This paper focuses on analytically solving the linear program for some simple regular network topologies.The two topologies considered are a regular linear array, and a regular two-dimensional network. In the linear case, an upper bound on functional lifetime is derived, as a function of the initial energies and quantities of data held by the sensors. Under some assumptions on the relative amounts of the energies and data, this upper bound is shown to be achievable, and the exact form of the optimal communication strategy is derived. For the regular planar network, upper and lower bounds on functional lifetime, differing only by a constant factor, are obtained.Finally, it is shown that the simple collection scheme of transmitting only to nearest neighbors, yields a nearly optimal lifetime in a scaling sense.},
}
@techreport{girod2003emstar,
	author = {Girod, Lewis and Elson, Jeremy and Cerpa, Alberto and Stathopoulos, Thanos and Ramanathan, Nithya and Estrin, Deborah},
	title = {{Em*: a Software Environment for Developing and Deploying Wireless Sensor Networks}},
	year = {2003},
	month = {March},
	institution = {Center for Embedded Networked Sensing, UCLA},
	number = {0009},
	type = {CENS Technical Report},
}
@inproceedings{girod2004system,
	author = {Girod, Lewis and Stathopoulos, Thanos and Ramanathan, Nithya and Elson, Jeremy and Estrin, Deborah and Osterweil, Eric and Schoellhammer., Tom},
	title = {{A System for Simulation, Emulation, and Deployment of Heterogeneous Sensor Networks}},
	booktitle = {2nd ACM Conference on Embedded Networked Sensor Systems (ACM SenSys 2004)},
	keywords = {Sensor Networks, Real Code Simulation, EmStar, TinyOS},
	year = {2004},
	month = {November},
	abstract = {Recently deployedWireless Sensor Network systems (WSNs)
are increasingly following heterogeneous designs, incorporat-
ing a mixture of elements with widely varying capabilities.
The development and deployment of WSNs rides heavily on
the availability of simulation, emulation, visualization and
analysis support. In this work, we develop tools specifically
to support heterogeneous systems, as well as to support the
measurement and visualization of operational systems that
is critical to addressing the inevitable problems that crop up
in deployment. Our system differs from related systems in
three key ways: in its ability to simulate and emulate heterogeneous
systems in their entirety, in its extensive support
for integration and interoperability between motes and mi-
croservers, and in its unified set of tools that capture, view,
and analyze real time debugging information from simula-
tions, emulations, and deployments.},
}
@article{goldenfeld1999simple,
	author = {Goldenfeld, Nigel and Kadanoff, Leo P.},
	title = {{Simple Lessons from Complexity}},
	journal = {Science},
	pages = {87-89},
	volume = {284},
	number = {5411},
	year = {1999},
	month = {April},
}
@article{gungor2007real-time,
	author = {Gungor, Vehbi C. and Akan, \"{O}zg\"{u}r B. and Akyildiz, Ian F.},
	title = {{A Real-Time and Reliable Transport Protocol for Wireless Sensor and Actor Networks}},
	journal = {IEEE/ACM Transactions on Networking (ToN)},
	year = {2007},
}
@inproceedings{gupta2003connected,
	author = {Gupta, Himanshu and Das, Samir R. and Gu, Quinyi},
	title = {{Connected Sensor Cover: Self-Organization of Sensor Networks for Efficient Query Execution}},
	booktitle = {4th ACM International Symposium on Mobile Ad Hoc Networking and Computing (ACM Mobihoc 2003)},
	keywords = {Sensor networks, sensor coverage, sensor connectivity, query optimization, connected sensor cover},
	year = {2003},
	month = {June},
	address = {Annapolis, Maryland, USA},
	abstract = {Spatial query execution is an essential functionality of a sensor
network, where a query gathers sensor data within a specific
geographic region. Redundancy within a sensor network
can be exploited to reduce the communication cost incurred
in execution of such queries. Any reduction in communication
cost would result in an efficient use of the battery
energy, which is very limited in sensors. One approach to
reduce the communication cost of a query is to self-organize
the network, in response to a query, into a topology that
involves only a small subset of the sensors sufficient to process
the query. The query is then executed using only the
sensors in the constructed topology.
In this article, we design and analyze algorithms for such
self-organization of a sensor network to reduce energy consumption.
In particular, we develop the notion of a connected
sensor cover and design a centralized approximation
algorithm that constructs a topology involving a nearoptimal
connected sensor cover. We prove that the size of
the constructed topology is within an O(log n) factor of the
optimal size, where n is the network size. We also develop
a distributed self-organization version of our algorithm, and
propose several optimizations to reduce the communication
overhead of the algorithm. Finally, we evaluate the distributed
algorithm using simulations and show that our approach
results in significant communication cost reduction.},
}
@article{gupta2000capacity,
	author = {Gupta, Piyush and Kumar, P.R.},
	title = {{The Capacity of Wireless Networks}},
	journal = {IEEE Transactions on Information Theory},
	pages = {388-404},
	volume = {46},
	number = {2},
	year = {2000},
	month = {March},
	abstract = {When n identical randomly located nodes, each capable of transmitting at W bits per second and using a fixed range, form a wireless network, the throughput λ(n) obtainable by each node for a randomly chosen destination is Θ(W/√(nlogn)) bits per second under a noninterference protocol. If the nodes are optimally placed in a disk of unit area, traffic patterns are optimally assigned, and each transmission's range is optimally chosen, the bit-distance product that can be transported by the network per second is Θ(W√An) bit-meters per second. Thus even under optimal circumstances, the throughput is only Θ(W/√n) bits per second for each node for a destination nonvanishingly far away. Similar results also hold under an alternate physical model where a required signal-to-interference ratio is specified for successful receptions. Fundamentally, it is the need for every node all over the domain to share whatever portion of the channel it is utilizing with nodes in its local neighborhood that is the reason for the constriction in capacity. Splitting the channel into several subchannels does not change any of the results. Some implications may be worth considering by designers. Since the throughput furnished to each user diminishes to zero as the number of users is increased, perhaps networks connecting smaller numbers of users, or featuring connections mostly with nearby neighbors, may be more likely to be find acceptance},
}
@article{guyton1991blood,
	author = {Guyton, AC},
	title = {{Blood pressure control - special role of the kidneys and body fluids}},
	journal = {Science},
	pages = {1813-1816},
	volume = {252},
	number = {5014},
	year = {1991},
	month = {June},
}
@inproceedings{haas2002gossip-based,
	author = {Haas, Zygmunt J. and Halpern, Joseph Y. and Li, Li},
	title = {{Gossip-Based Ad Hoc Routing}},
	booktitle = {21st IEEE Conference on Computer Communications (IEEE INFOCOM 2002)},
	pages = {1707-1716},
	year = {2002},
	month = {June},
}
@article{haas2001performance,
	author = {Haas, Zygmunt J. and Pearlman, Marc R.},
	title = {{The Performance of Query Control Schemes for the Zone Routing Protocol}},
	journal = {IEEE/ACM Transactions on Networking (TON)},
	pages = {427-438},
	volume = {9},
	keywords = {ad-hoc network, routing protocol, routing zone, ZRP, zone routing protocol, proactive routing, reactive routing, hybrid routing, bordercast, query control},
	year = {2001},
	month = {August},
	abstract = {In this paper, we study the performance of route
query control mechanisms for the Zone Routing Protocol
(ZRP) for ad hoc networks. ZRP proactively maintains
routing information for a local neighborhood (routing
zone), while reactively acquiring routes to destinations
beyond the routing zone. This hybrid routing approach can
be more efficient than traditional routing schemes.
However, without proper query control techniques, ZRP
cannot provide the expected reduction in the control traffic.
Our proposed query control schemes exploit the structure
of the routing zone to provide enhanced detection and
prevention of overlapping queries. These techniques can be
applied to single-channel or multiple-channel ad hoc
networks to improve both the delay and control traffic
performance of ZRP. Our query control mechanisms
allow ZRP to provide routes to all accessible network nodes,
with less control traffic than purely proactive link state or
purely reactive route discovery, and with less delay than
conventional flood searching.},
}
@article{han2005sensor,
	author = {Han, Chih-Chieh and Kumar, Ram and Shea, Roy and Srivastava, Mani},
	title = {{Sensor Network Software Update Management: A Survey}},
	journal = {ACM International Journal on Network Management},
	pages = {283-294},
	volume = {15},
	number = {4},
	year = {2005},
	month = {July},
	abstract = {The existing tools for software updates in workstations cannot be used with the severely resource
constrained sensor nodes. In this article, we survey the software update techniques based on
a conceptual model in WSNs. Three components of this model that we study are the execution
environment at the sensor nodes, the software distribution protocol in the network and optimization
of transmitted updates.
Abstract
Software management is a critical task in the system administration of enterprise scale networks.
Enterprise scale networks that have traditionally comprised of large clusters of workstations
are expanding to include low power ad-hoc wireless sensor networks (WSN). The existing
tools for software updates in workstations cannot be used with the severely resource constrained
sensor nodes. In this article, we survey the software update techniques in WSNs. We base our
discussion around a conceptual model for the software update tools in WSNs. Three components
of this model that we study are the execution environment at the sensor nodes, the software
distribution protocol in the network and optimization of transmitted updates. We present the
design space of each component and discuss in-depth the trade offs that need to be considered
in making a particular design choice. The discussion is interspersed with references to deployed
systems that highlight the design choices.},
}
@inproceedings{han2006path,
	author = {Han, Yijie and La, Richard J. and Zhang, Hongqiang},
	title = {{Path Selection in Mobile Ad-hoc Networks and Distribution of Path Duration}},
	booktitle = {25th IEEE Conference on Computer Communications (IEEE INFOCOM 2006)},
	pages = {1-22},
	year = {2006},
	month = {April},
	address = {Barcelona, Spain},
}
@inproceedings{handziski2004improving,
	author = {Handziski, Vlado and K\"{o}pke, Andreas and Karl, Holger and Frank, Christian and Drytkiewicz, Witold},
	title = {{Improving the Energy Efficiency of Directed Diffusion Using Pervasive Clustering}},
	booktitle = {1st European Workshop in Wireless Sensor Networks (EWSN)},
	pages = {172-187},
	volume = {LNCS 2920},
	year = {2004},
	month = {January},
	address = {Berlin, Germany},
}
@inproceedings{handziski2005flexible,
	author = {Handziski, Vlado and Polastrey, Joseph and Hauer, Jan-Hinrich and Sharpy, Cory and Wolisz, Adam and Culler, David},
	title = {{Flexible Hardware Abstraction for Wireless Sensor Networks}},
	booktitle = {2nd European Workshop on Wireless Sensor Networks (EWSN 2005)},
	year = {2005},
	month = {February},
	address = {Istanbul, Turkey},
	abstract = {We present a flexible Hardware Abstraction
Architecture (HAA) that balances conflicting requirements
of Wireless Sensor Networks (WSNs) applications and the
desire for increased portability and streamlined development
of applications. Our three-layer design gradually
adapts the capabilities of the underlying hardware platforms
to the selected platform-independent hardware interface
between the operating system core and the application
code. At the same time, it allows the applications to utilize
a platform’s full capabilities – exported at the second layer,
when the performance requirements outweigh the need for
cross-platform compatibility.We demonstrate the practical
value of our approach by presenting how it can be applied
to the most important hardware modules that are found
in a typical WSN platform. We support our claims using
concrete examples from existing hardware abstractions in
TinyOS and our implementation of the MSP430 platform
that follows the architecture proposed in this paper.},
}
@article{hartigan1979k-means,
	author = {Hartigan, J. A. and Wong, M. A.},
	title = {{A K-Means Clustering Algorithm }},
	journal = {Applied Statistics},
	pages = {100-108},
	volume = {28},
	number = {1},
	year = {1979},
}
@techreport{hatler2005wireless,
	author = {Hatler, Mareca and Chi, Charlie},
	title = {{Wireless Sensor Networks: Growing Markets, Accelerating Demand}},
	year = {2005},
	month = {February},
	institution = {ON World},
	type = {ON World Report},
	url = {http://onworld.com/html/wirelesssensorsrprt2.htm},
}
@article{hedetniemi1988survey,
	author = {Hedetniemi, S. M. and Hedetniemi, S. T. and Liestman, A.},
	title = {{A survey of gossiping and broadcasting in communication networks}},
	journal = {Networks},
	pages = {319-349},
	volume = {18},
	number = {4},
	year = {1988},
}
@inproceedings{heinzelman2000energy-efficient,
	author = {Rabiner Heinzelman, Wendi and Chandrakasan, Anantha and Balakrishnan, Hari},
	title = {{Energy-Efficient Communication Protocol for Wireless Microsensor Networks}},
	booktitle = {33rd Hawaii International Conference on System Sciences},
	year = {2000},
	abstract = {Wireless distributed microsensor systems will enable the
reliable monitoring of a variety of environments for both
civil and military applications. In this paper, we look at
communication protocols, which can have significant impact
on the overall energy dissipation of these networks.
Based on our findings that the conventional protocols of
direct transmission, minimum-transmission-energy, multihop
routing, and static clustering may not be optimal for
sensor networks, we propose LEACH (Low-Energy Adaptive
Clustering Hierarchy), a clustering-based protocol that
utilizes randomized rotation of local cluster base stations
(cluster-heads) to evenly distribute the energy load among
the sensors in the network. LEACH uses localized coordination
to enable scalability and robustness for dynamic networks,
and incorporates data fusion into the routing protocol
to reduce the amount of information that must be transmitted
to the base station. Simulations show that LEACH
can achieve as much as a factor of 8 reduction in energy
dissipation compared with conventional routing protocols.
In addition, LEACH is able to distribute energy dissipation
evenly throughout the sensors, doubling the useful system
lifetime for the networks we simulated.},
}
@misc{heylighen1999science,
	author = {Heylighen, Francis},
	title = {{The Science Of Self-Organization And Adaptivity}},
	howpublished = {The Encyclopedia of Life Support Systems (EOLSS)},
	year = {1999},
}
@inproceedings{hof2004design,
	author = {Hof, Hans-Joachim and Bla\ss, Erik-Oliver and Fuhrmann, Thomas and Zitterbart, Martina},
	title = {{Design of a Secure Distributed Service Directory for Wireless Sensornetworks}},
	booktitle = {First European Workshop on Wireless Sensor Networks},
	year = {2004},
	month = {January},
	abstract = {Sensor networks consist of a potentially huge number of very small and resource limited self-organizing devices. This paper presents the design of a general distributed service directory architecture for sensor networks which especially focuses on the security issues in sensor networks. It ensures secure construction and maintenance of the underlying storage structure, a Content Addressable Network. It also considers integrity of the distributed service directory and secures communication between service provider and inquirer using self-certifying path names. Key area of application of this architecture are gradually extendable sensor networks where sensors and actuators jointly perform various user defined tasks, e.g., in the field of an office environment.},
}
@inproceedings{hof2004secure,
	author = {Hof, Hans-Joachim and Bla\ss, Erik-Oliver and Zitterbart, Martina},
	title = {{Secure Overlay for Service Centric Wireless Sensor Networks}},
	booktitle = {First European Workshop on Security in Ad-Hoc and Sensor Networks (ESAS 2004)},
	year = {2004},
	month = {August},
	abstract = {Sensor networks consist of a potentially huge number of very small and resource limited self-organizing devices. Those devices offer different services and use services provided by other sensor nodes. To give sensor nodes the possibility to offer services and to network-wide search for available services, some kind of lookup facility is needed. Several possibilities exist to realize service lookup in traditional networks and ad-hoc networks. In this paper we present Secure Content Addressable Networks Version 2 (SCANv2), a secure overlay focusing especially on wireless sensor networks. The paper describes how this secure overlay can be used among other things to offer lookup functionality in sensor networks. The design of the overlay focuses on secure service lookups. The overlay is part of the Karlsruhe Sensor Network Platform K-SNeP, a modular and flexible architecture for service centric sensor networks. Key areas of application of the architecture are gradually extendable service centric sensor networks where sensors and actuators jointly perform various user defined tasks, e.g. in the field of an office environment or health care.},
}
@article{hofmeyr2000architecture,
	author = {Hofmeyr, Steven A. and Forrest, Stephanie},
	title = {{Architecture for an Artificial Immune System}},
	journal = {Evolutionary Computation},
	pages = {443-473},
	volume = {8},
	number = {4},
	year = {2000},
}
@inproceedings{holland1999analysis,
	author = {Holland, Gavin and Vaidya, Nitin},
	title = {{Analysis of TCP Performance over Mobile Ad Hoc Networks}},
	booktitle = {5th ACM International Conference on Mobile Computing and Networking (ACM MobiCom 1999)},
	pages = {219-230},
	year = {1999},
	address = {Seattle, Wasington, USA},
}
@inproceedings{hollos2004regionalizing,
	author = {Hollos, D. and Karl, Holger and Wolisz, Adam},
	title = {{Regionalizing Global Optimization Algorithms to Improve the Operation of Large Ad Hoc Networks}},
	booktitle = {IEEE Wireless Communications and Networking Conference},
	year = {2004},
	address = {Atlanta, Georgia, USA},
}
@article{hong2002scalable,
	author = {Hong, Xiaoyan and Xu, Kaixin and Gerla, Mario},
	title = {{Scalable Routing Protocols for Mobile Ad Hoc Networks}},
	journal = {IEEE Network},
	pages = {11-21},
	volume = {16},
	year = {2002},
	month = {July/August},
	abstract = {The growing interest in mobile ad hoc network techniques has resulted in many routing
protocol proposals. Scalability issues in ad hoc networks are attracting increasing
attention these days. In this article we will survey the routing protocols that
address scalability. The routing protocols we intend to include in the survey fall into
three categories: flat routing protocols, hierarchical routing approaches, and GPS
augmented geographical routing schemes. The article will compare the scalability
properties and operational features of the protocols and discuss challenges in future
routing protocol designs.},
}
@article{howard2002incremental,
	author = {Howard, Andrew and Mataric, Maja J. and Sukhatme, Gaurav S.},
	title = {{An Incremental Self-Deployment Algorithm for Mobile-Sensor Networks}},
	journal = {Autonomous Robots},
	pages = {113-126},
	volume = {13},
	number = {2},
	year = {2002},
	month = {September},
}
@inproceedings{hubaux2000towards,
	author = {Hubaux, Jean-Pierre and Le Boudec, Jean-Yves and Giordano, S. and Hamdi, M. and Blazevic, L. and Butty\'{a}n, Levente and Vojnovic, M.},
	title = {{Towards Mobile Ad-Hoc WANs: Terminodes}},
	booktitle = {IEEE Wireless Communications and Networking Conference (WCNC 2000)},
	year = {2000},
	address = {Chicago, USA},
	abstract = {Terminodes are personal devices that provide func-
tionality of both the terminals and the nodes of the network.
A network of terminodes is an autonomous, fully self-organized,
wireless network, independent of any infrastructure. It must be
able to scale up to millions of units, without any fixed backbone
or server. In this paper we present the main challenges and dis-
cuss the main technical directions.},
}
@inproceedings{hubaux2001quest,
	author = {Hubaux, Jean-Pierre and Butty\'{a}n, Levente and Capkun, Srdjan},
	title = {{The Quest for Security in Mobile Ad Hoc Networks}},
	booktitle = {2nd ACM International Symposium on Mobile Ad Hoc Networking and Computing (ACM Mobihoc 2001)},
	pages = {146-155},
	year = {2001},
	month = {October},
	address = {Long Beach, CA, USA},
	publisher = {ACM},
}
@inproceedings{hui2004dynamic,
	author = {Hui, Jonathan and Culler, David},
	title = {{The Dynamic Behavior of a Data Dissemination Protocol for Network Programming at Scale}},
	booktitle = {2nd ACM Conference on Embedded Networked Sensor Systems (ACM SenSys 2004)},
	year = {2004},
	month = {November},
	address = {Baltimore, MD, USA},
}
@inproceedings{huitema1996case,
	author = {Huitema, Christian},
	title = {{The case for packet level FEC}},
	booktitle = {IFIP Fifth International Workshop on Protocols for High Speed Networks},
	pages = {109-120},
	year = {1996},
	month = {October},
	address = {Sophia Antipolis, France},
}
@inproceedings{hurler2004general,
	author = {Hurler, Bernhard and Hof, Hans-Joachim and Zitterbart, Martina},
	title = {{A General Architecture for Wireless Sensor Networks: First Steps}},
	booktitle = {4th International Workshop on Smart Appliances and Wearable Computing},
	pages = {442-444},
	year = {2004},
	month = {March},
	address = {Tokyo, Japan},
	abstract = {Wireless sensor networks have become a very attractive research topic in recent years. Many academic and professional research groups made efforts to construct operative hardware devices and sophisticated software to meet the special conditions in their projects. But still there has been little done to create a general structure for smart sensors to cooperate and to offer their services to human or software clients. In this paper we present first results of our investigations in this topic. As a test scenario and source of inspiration we set up a sensor network prototype in an office situation, where the physical environment should be measured and adjusted according to specific conditions. In particular the light and humidity state of potted plants within an office should be autonomously adjusted to the plants special needs as most research associates in our lab forget to care for their plants on a regular basis. On the basis of this prolific scenario we introduce a first stage middleware system architecture providing service distribution and accomplishment within wireless sensor networks. Core components of the architecture have been implemented in hardware and software to show the feasibility and abilities of our approach.},
}
@inproceedings{ibriq2004cluster-based,
	author = {Ibriq, Jamil and Mahgoub, Imad},
	title = {{Cluster-Based Routing in Wireless Sensor Networks: Issues and Challenges}},
	booktitle = {International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS'04)},
	pages = {759-766},
	year = {2004},
	month = {July},
	address = {San Jose, California, USA},
	abstract = {This paper describes the characteristics of wireless sensor
netwoks (WSN) and how they influence the design of
routing protocols. It discusses the design criteria of
cluster-based routing and focuses on the issues and
challenges of cluster-based routing protocols in WSN.},
}
@inproceedings{intanagonwiwat2000directed,
	author = {Intanagonwiwat, Chalermek and Govindan, Ramesh and Estrin, Deborah},
	title = {{Directed diffusion: A scalable and robust communication paradigm for sensor networks}},
	booktitle = {6th ACM International Conference on Mobile Computing and Networking (ACM MobiCom 2000)},
	pages = {56-67},
	year = {2000},
	month = {August},
	address = {Boston, MA, USA},
}
@article{iwata1999scalable,
	author = {Iwata, Atsushi and Chiang, Ching-Chuan and Pei, Guangyu and Gerla, Mario and Chen, Tsu-Wei},
	title = {{Scalable Routing Strategies for Ad Hoc Wireless Networks}},
	journal = {IEEE Journal on Selected Areas in Communications, Special Issue on Ad-Hoc Networks},
	pages = {1369-1379},
	volume = {17},
	number = {8},
	keywords = {Ad-hoc wireless networks, fisheye routing, hierarchical routing, multihop network, mobile network, quality-ofservice (QoS) routing, scalable routing.},
	year = {1999},
	month = {August},
	abstract = {In this paper, we consider a large population of
mobile stations that are interconnected by a multihop wireless
network. The applications of this wireless infrastructure range
from ad hoc networking (e.g., collaborative, distributed computing)
to disaster recovery (e.g., fire, flood, earthquake), law
enforcement (e.g., crowd control, search-and-rescue), and military
(automated battlefield). Key characteristics of this system are the
large number of users, their mobility, and the need to operate
without the support of a fixed (wired or wireless) infrastructure.
The last feature sets this system apart from existing cellular
systems and in fact makes its design much more challenging.
In this environment, we investigate routing strategies that scale
well to large populations and can handle mobility. In addition,
we address the need to support multimedia communications,
with low latency requirements for interactive traffic and qualityof-
service (QoS) support for real-time streams (voice/video). In
the wireless routing area, several schemes have already been
proposed and implemented (e.g., hierarchical routing, on-demand
routing, etc.). We introduce two new schemes—fisheye state
routing (FSR) and hierarchical state routing (HSR)—which offer
some competitive advantages over the existing schemes. We
compare the performance of existing and proposed schemes via
simulation.},
}
@inproceedings{jeong2004incremental,
	author = {Jeong, Jaein and Culler, David},
	title = {{Incremental Network Programming for Wireless Sensors}},
	booktitle = {First IEEE International Conference on Sensor and Ad hoc Communications and Networks (IEEE SECON)},
	year = {2004},
	month = {June},
}
@inproceedings{johnson2006robotic,
	author = {Johnson, David and Stack, Tim and Fish, Russ and Flickinger, Daniel Montrallo and Stoller, Leigh and Ricci, Robert and Lepreau, Jay},
	title = {{Mobile Emulab: A Robotic Wireless and Sensor Network Testbed}},
	booktitle = {25th IEEE Conference on Computer Communications (IEEE INFOCOM 2006)},
	year = {2006},
	month = {April},
	address = {Barcelona, Spain},
}
@inproceedings{johnson1994routing,
	author = {Johnson, David B.},
	title = {{Routing in Ad Hoc Networks of Mobile Hosts}},
	booktitle = {Workshop on Mobile Computing Systems and Applications},
	pages = {158-163},
	year = {1994},
	month = {December},
	address = {Santa Cruz, CA},
	publisher = {IEEE,},
}
@incollection{johnson1996dynamic,
	author = {Johnson, David B. and Maltz, David A.},
	editor = {Imielinski, Tomasz and Korth, Henry F.},
	title = {{Dynamic Source Routing in Ad Hoc Wireless Networks}},
	booktitle = {Mobile Computing},
	pages = {152-181},
	volume = {353},
	year = {1996},
	publisher = {Kluwer Academic Publishers},
	abstract = {An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the
aid of any established infrastructure or centralized administration. In such an environment, it may be
necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination,
due to the limited range of each mobile host’s wireless transmissions. This paper presents a protocol
for routing in ad hoc networks that uses dynamic source routing. The protocol adapts quickly to routing
changes when host movement is frequent, yet requires little or no overhead during periods in which
hosts move less frequently. Based on results from a packet-level simulation of mobile hosts operating in
an ad hoc network, the protocol performs well over a variety of environmental conditions such as host
density and movement rates. For all but the highest rates of host movement simulated, the overhead of
the protocol is quite low, falling to just 1% of total data packets transmitted for moderate movement rates
in a network of 24 mobile hosts. In all cases, the difference in length between the routes used and the
optimal route lengths is negligible, and in most cases, route lengths are on average within a factor of 1.01
of optimal.},
}
@incollection{johnson2001dsr,
	author = {Johnson, David B. and Maltz, David A. and Broch, Josh},
	editor = {Perkins, Charles E.},
	title = {{DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks}},
	booktitle = {Ad Hoc Networking},
	pages = {139-172},
	year = {2001},
	publisher = {Addison-Wesley},
}
@article{johnson1967hierarchical,
	author = {Johnson, Stephen C.},
	title = {{Hierarchical clustering schemes}},
	journal = {Psychometrika},
	pages = {241-254},
	volume = {32},
	number = {3},
	year = {1967},
	month = {September},
}
@article{juang2002energy-efficient,
	author = {Juang, Philo and Oki, Hidekazu and Wang, Yong and Martonosi, Margaret and Peh, Li-Shiuan and Rubenstein, Daniel},
	title = {{Energy-Efficient Computing for Wildlife Tracking: Design Tradeoffs and Early Experiences with ZebraNet}},
	journal = {ACM SIGOPS Operating Systems Review},
	pages = {96-107},
	volume = {36},
	number = {5},
	year = {2002},
	month = {December},
}
@inproceedings{jung2001cooperative,
	author = {Jung, Boyoon and Sukhatme, Gaurav S.},
	title = {{Cooperative Tracking using Mobile Robots and Environment-Embedded, Network Sensors}},
	booktitle = {2001 International Symposium on Computational Intelligence in Robotics and Automation},
	pages = {206-211},
	year = {2001},
	month = {July},
	address = {Banff, Alberta, Canada},
}
@inproceedings{jung2002power,
	author = {Jung, Eun-Sun and Vaidya, Nitin},
	title = {{A Power Control MAC Protocol for Ad Hoc Networks}},
	booktitle = {8th ACM International Conference on Mobile Computing and Networking (ACM MobiCom 2002)},
	year = {2002},
	month = {September},
}
@article{jung2005power,
	author = {Jung, Eun-Sun and Vaidya, Nitin H.},
	title = {{A Power Control MAC Protocol for Ad Hoc Networks}},
	journal = {ACM/Kluwer Wireless Networks (WINET)},
	pages = {55-66},
	volume = {11},
	number = {1-2},
	year = {2005},
}
@inproceedings{kadrovach2002practicle,
	author = {Kadrovach, B. Anthony and Lamont, Gary B.},
	title = {{A Practicle Swarm Model for Swarm-based Networked Sensor Systems}},
	booktitle = {ACM Symposium on Applied Computing (SAC'02)},
	pages = {918-924},
	year = {2002},
	address = {Madrid, Spain},
}
@inproceedings{kahn1999next,
	author = {Kahn, Joseph M. and Katz, Randy and Pister, Kristopher},
	title = {{Next Century Challenges: Mobile Networking for "Smart Dust"}},
	booktitle = {5th ACM International Conference on Mobile Computing and Networking (ACM MobiCom 1999)},
	pages = {271-278},
	year = {1999},
	address = {Seattle, Washington, USA},
}
@article{kahn2000emerging,
	author = {Kahn, Joseph M. and Katz, Randy and Pister, Kristopher},
	title = {{Emerging Challenges: Mobile Networking for "Smart Dust"}},
	journal = {Journal of Communications and Networking},
	volume = {2},
	number = {3},
	year = {2000},
	month = {September},
}
@inproceedings{karn1990maca,
	author = {Karn, Phil},
	title = {{MACA: a new channel access method for packet radio}},
	booktitle = {ARRL/CRRL Amateur Radio 9th Computer Networking Conference},
	pages = {134-140},
	year = {1990},
	address = {London, Ontario, Canada},
}
@inproceedings{karp2000gpsr,
	author = {Karp, Brad and Kung, H. T.},
	title = {{GPSR: Greedy Perimeter Stateless Routing for Wireless Networks}},
	booktitle = {6th ACM International Conference on Mobile Computing and Networking (ACM MobiCom 2000)},
	pages = {243-254},
	year = {2000},
	address = {Boston, Massachusetts, USA},
	abstract = {We present Greedy Perimeter Stateless Routing (GPSR), a novel
routing protocol for wireless datagram networks that uses the positions
of routers and a packet’s destination to make packet forwarding
decisions. GPSR makes greedy forwarding decisions using
only information about a router’s immediate neighbors in the
network topology. When a packet reaches a region where greedy
forwarding is impossible, the algorithm recovers by routing around
the perimeter of the region. By keeping state only about the local
topology, GPSR scales better in per-router state than shortest-path
and ad-hoc routing protocols as the number of network destinations
increases. Under mobility’s frequent topology changes, GPSR can
use local topology information to find correct new routes quickly.
We describe the GPSR protocol, and use extensive simulation of
mobile wireless networks to compare its performance with that of
Dynamic Source Routing. Our simulations demonstrate GPSR’s
scalability on densely deployed wireless networks.},
}
@techreport{karp2003optimal,
	author = {Karp, Richard and Elson, Jeremy and Estrin, Deborah and Shenker, Scott},
	title = {{Optimal and Global Time Synchronization in Sensornets}},
	year = {2003},
	month = {April},
	institution = {UCLA, Dept. of Computer Science},
	number = {012},
	type = {CENS Technical Report},
}
@article{kashiwagi2006adaptive,
	author = {Kashiwagi, Akiko and Urabe, Itaru and Kaneko, Kunihiko and Yomo, Tetsuya},
	title = {{Adaptive Response of a Gene Network to Environmental Changes by Fitness-Induced Attractor Selection}},
	journal = {PLoS ONE},
	pages = {e49},
	volume = {1},
	number = {1},
	year = {2006},
	month = {December},
}
@article{kempe2001spatial,
	author = {Kempe, David and Kleinberg, Jon and Demers, Alan},
	title = {{Spatial Gossip and Resource Location Protocols}},
	journal = {Journal of the ACM (JACM)},
	pages = {943-967},
	volume = {51},
	number = {6},
	year = {2001},
	month = {November},
}
@inproceedings{kephart1994biologically,
	author = {Kephart, Jeffrey O.},
	title = {{A Biologically Inspired Immune System for Computers}},
	booktitle = {4th International Workshop on Synthesis and Simulation of Living Systems},
	pages = {130-139},
	year = {1994},
	address = {Cambridge, Massachusetts, USA},
	publisher = {MIT Press},
}
@incollection{khan2007security,
	author = {Khan, Moazzam and Misic, Jelena},
	editor = {ZHANG, Yan and ZHENG, Jun and HU, Honglin},
	title = {{Security in IEEE 802.15.4 cluster based networks}},
	booktitle = {Security in Wireless Mesh Networks},
	year = {2007},
	publisher = {Auerbach Publications, CRC Press},
}
@inproceedings{kim2001evaluation,
	author = {Kim, Jungwon and Bentley, Peter J.},
	title = {{An Evaluation of Negative Selection in an Artificial Immune System for Network Intrusion Detection}},
	booktitle = {Genetic and Evolutionary Computation Conference (GECCO-2001)},
	pages = {1330-1337},
	year = {2001},
	month = {July},
	address = {San Francisco, CA},
}
@inproceedings{kim2002towards,
	author = {Kim, Jungwon and Bentley, Peter J.},
	title = {{Towards an Artificial Immune System for Network Intrusion Detection}},
	booktitle = {IEEE Congress on Evolutionary Computation (CEC)},
	pages = {1015-1020},
	year = {2002},
	month = {May},
	address = {Honolulu},
}
@article{kim2004modeling,
	author = {Kim, Yongjin and Lee, Jae-Joon and Helmy, Ahmed},
	title = {{Modeling and Analyzing the Impact of Location Inconsistencies on Geographic Routing in Wireless Networks}},
	journal = {ACM SIGMOBILE Mobile Computing and Communications Review},
	pages = {48-60},
	volume = {8},
	number = {1},
	year = {2004},
	month = {January},
}
@inproceedings{ko1998location-aided,
	author = {Ko, Young-Bae and Vaidya, Nitin H.},
	title = {{Location-aided Routing (LAR) in Mobile Ad Hoc Networks}},
	booktitle = {4th ACM International Conference on Mobile Computing and Networking (ACM MobiCom 1998)},
	pages = {66-75},
	year = {1998},
	address = {Dallas, Texas, United States},
	abstract = {A mobile ad hoc network consists of wireless hosts that may move often. Movement of hosts results in a change in routes,
requiring some mechanism for determining new routes. Several routing protocols have already been proposed for ad hoc networks.
This paper suggests an approach to utilize location information (for instance, obtained using the global positioning system) to improve
performance of routing protocols for ad hoc networks. By using location information, the proposed Location-Aided Routing (LAR)
protocols limit the search for a new route to a smaller “request zone” of the ad hoc network. This results in a significant reduction in
the number of routing messages. We present two algorithms to determine the request zone, and also suggest potential optimizations to our algorithms.},
}
@article{ko2002flooding-based,
	author = {Ko, Young-Bae and Vaidya, Nitin H.},
	title = {{Flooding-Based Geocasting Protocols for Mobile Ad Hoc Networks}},
	journal = {Mobile Networks and Applications},
	pages = {471-480},
	volume = {7},
	number = {6},
	year = {2002},
	month = {December},
}
@article{krieger2000ant-like,
	author = {Krieger, Michael J. B. and Billeter, Jean-Bernard and Keller, Laurent},
	title = {{Ant-like task allocation and recruitment in cooperative robots}},
	journal = {Nature},
	pages = {992-995},
	volume = {406},
	year = {2000},
	month = {August},
}
@inproceedings{krishnamachari2002impact,
	author = {Krishnamachari, Bhaskar and Estrin, Deborah and Wicker, Stephen},
	title = {{The Impact of Data Aggregation in Wireless Sensor Networks}},
	booktitle = {International Workshop Distributed Event Based System (DEBS)},
	year = {2002},
	month = {July},
	abstract = {Sensor networks are distributed event-based systems that
differ from traditional communication networks in several
ways: sensor networks have severe energy constraints,
redundant low-rate data, and many-to-one flows. Datacentric
mechanisms that perform in-network aggregation
of data are needed in this setting for energy-efficient information
flow. In this paper we model data-centric routing
and compare its performance with traditional end-toend
routing schemes. We examine the impact of sourcedestination
placement and communication network density
on the energy costs and delay associated with data aggregation.
We show that data-centric routing offers significant
performance gains across a wide range of operational scenarios.
We also examine the complexity of optimal data aggregation,
showing that although it is an NP-hard problem
in general, there exist useful polynomial-time special cases.},
}
@article{kumar2004robot,
	author = {Kumar, V. and Rus, D. and Singh, S.},
	title = {{Robot and Sensor Networks for First Responders}},
	journal = {IEEE Pervasive Computing},
	pages = {24-33},
	volume = {3},
	number = {4},
	year = {2004},
	month = {October-December},
}
@article{kwon2002efficient,
	author = {Kwon, Taek Jin and Gerla, Mario},
	title = {{Efficient Flooding with Passive Clustering (PC) in Ad Hoc Networks}},
	journal = {ACM SIGCOMM Computer Communication Review},
	year = {2002},
	abstract = {An ad hoe network is a fast deployable selfconfiguring
wireless network characterized by node
mobility, dynamic topology structure, unreliable
media and limited power supply. Nodes in an ad hoe
network must cooperate and carry out a distributed
routing protocol in order to make multi-hop
communications possible. On Demand Routing is
one of the most popular routing styles in ad hoc
networks. In On Demand Routing, "flooding" Is
used to find a feasible route from source to
destination. The function of flooding is to deliver a
packet from one source to every other node in the
system. Conventional flooding can be very costly in
On Demand networks in terms of network
throughput efficiency as well as node energy
consumption. The main reason is that the same
packet is rebroadcast unnecessarily several times
(redundant rebroadcast). Indeed, the penalty of
redundant rebroadcast increases when the size of
network grows and the density of network increases.
In this paper we introduce a novel clustering
scheme, call Passive Clustering that can reduce the
redundant rebroadcast effect in flooding. We
demonstrate the efficiency of the proposed scheme
in the AODV (Ad hoe., On demand Distance Vector)
routing scheme.},
}
@inproceedings{kyasanur2006smart,
	author = {Kyasanur, Pradeep and Choudhury, Romit Roy and Gupta, Indranil},
	title = {{Smart Gossip: An Adaptive Gossip-based Broadcasting Service for Sensor Networks}},
	booktitle = {3rd IEEE International Conference on Mobile Ad Hoc and Sensor Systems (IEEE MASS 2006)},
	pages = {91-100},
	year = {2006},
	month = {October},
	address = {Vancouver, Canada},
}
@inproceedings{labella2004efficiency,
	author = {Labella, Thomas Halva and Dorigo, Marco},
	title = {{Efficiency and task allocation in prey retrieval}},
	booktitle = {First International Workshop on Biologically Inspired Approaches to Advanced Information Technology (Bio-ADIT2004)},
	pages = {32-47},
	year = {2004},
	month = {January},
	address = {Lausanne, Switzerland},
}
@inproceedings{labella2004self-organised,
	author = {Labella, Thomas Halva and Dorigo, Marco and Deneubourg, Jean-Louis},
	title = {{Self-Organised Task Allocation in a Group of Robots}},
	booktitle = {7th International Symposium on Distributed Autonomous Robotic Systems (DARS04)},
	year = {2004},
	month = {June},
	address = {Toulouse, France},
	abstract = {Robot foraging, a frequently used test application for collective robotics,
consists in a group of robots retrieving a set of opportunely defined objects to a target 
location. A commonly observed experimental result is that the retrieving efficiency
of the group of robots, measured for example as the number of units retrieved by
a robot in a given time interval, tends to decrease with increasing group sizes. In
this paper we describe a biology inspired method for tuning the number of foraging
robots in order to improve the group efficiency. As a result of our experiments, in
which robots use only locally available information and do not communicate with
each other, we observe self-organised task allocation. This task allocation is effective
in exploiting mechanical differences among the robots inducing specialisation in the
robots activities.},
}
@inproceedings{lagoudakis2004auctions,
	author = {Lagoudakis, Michail G. and Berhault, Marc and Koenig, Sven and Keskinocak, Pinar and Kleywegt, Anton J.},
	title = {{Simple Auctions with Performance Guarantees for Multi-Robot Task Allocation}},
	booktitle = {IEEE/RSJ International Conference on Intelligent Robots and Systems},
	year = {2004},
	month = {September/October},
	address = {Sendai, Japan},
	abstract = {We consider the problem of allocating a number
of exploration tasks to a team of mobile robots. Each task
consists of a target location that needs to be visited by a robot.
The objective of the allocation is to minimize the total cost,
that is, the sum of the travel costs of all robots for visiting
all targets. We show that finding an optimal allocation is an
NP-hard problem, even in known environments. The main
contribution of this paper is PRIM ALLOCATION, a simple and
fast approximate algorithm for allocating targets to robots
which provably computes allocations whose total cost is at
most twice as large as the optimal total cost. We then cast
PRIM ALLOCATION in terms of a multi-round single-item
auction where robots bid on targets, which allows for a decentralized
implementation. To the best of our knowledge, PRIM
ALLOCATION is the first auction-based allocation algorithm
that provides a guarantee on the quality of its allocations. Our
experimental results in a multi-robot simulator demonstrate
that PRIM ALLOCATION is fast and results in close-to-optimal
allocations despite its simplicity and decentralized nature. In
particular, it needs an order of magnitude fewer bids than
a computationally intensive allocation algorithm based on
combinatorial auctions, yet its allocations are at least as good.},
}
@inproceedings{lahiri2002battery-driven,
	author = {Lahiri, Kanishka and Dey, Sujit and Panigrahi, Debashis and Raghunathan, Anand},
	title = {{Battery-Driven System Design: A New Frontier in Low Power Design}},
	booktitle = {2002 Conference on Asia South Pacific Design Automation / VLSI Design},
	pages = {261},
	year = {2002},
}
@article{lamport1978time,
	author = {Lamport, Leslie},
	title = {{Time, Clocks, and the Ordering of Events in a Distributed System}},
	journal = {Communications of the ACM},
	pages = {558-565},
	volume = {21},
	number = {4},
	year = {1978},
	month = {July},
}
@inproceedings{landsiedel2005accurate,
	author = {Landsiedel, Olaf and Wehrle, Klaus and G\"{o}tz, Stefan},
	title = {{Accurate Prediction of Power Consumption in Sensor Networks}},
	booktitle = {Second IEEE Workshop on Embedded Networked Sensors (EmNetS-II)},
	year = {2005},
	month = {May},
	address = {Sydney, Australia},
}
@inproceedings{leboudec2004artificial,
	author = {Le Boudec, Jean-Yves and Sarafijanovic, Slavisa},
	title = {{An Artificial Immune System Approach to Misbehavior Detection in Mobile Ad-Hoc Networks}},
	booktitle = {First International Workshop on Biologically Inspired Approaches to Advanced Information Technology (Bio-ADIT2004)},
	pages = {96-111},
	year = {2004},
	month = {January},
	address = {Lausanne, Switzerland},
}
@inproceedings{lee1999artificial,
	author = {Lee, D. W. and Jun, H. B. and Sim, K. B.},
	title = {{Artificial immune system for realization of cooperative strategies and group behavior in collective autonomous mobile robots}},
	booktitle = {4th International Symposium on Artificial Life and Robotics},
	pages = {232-235},
	year = {1999},
}
@inproceedings{lee2004impact,
	author = {Lee, Jae-Joon and Krishnamachari, Bhaskar and Kuo, C.-C. Jay},
	title = {{Impact of Heterogeneous Deployment on Lifetime Sensing Coverage in Sensor Networks}},
	booktitle = {IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks (IEEE SECON 2004)},
	pages = {367-376},
	year = {2004},
	month = {October},
	abstract = {While most research on wireless sensor networks
has focused on the deployment of large numbers of cheap
homogeneous sensor devices, in practical settings it is often
feasible to consider heterogeneous deployments of devices with
different capabilities. Under prescribed cost constraints, we
analyze such heterogenous deployments both mathematically and
through simulations, and show how they impact the coverage
aging process of a sensor network, i.e., how it degrades over time
as some nodes become energy-depleted. We derive expressions for
the heterogeneous mixture of devices that optimizes the lifetime
sensing coverage in a single-hop direct communication model.
We then investigate a multi-hop communication model through
simulations, and examine the impact of heterogeneity on lifetime
sensing coverage and coverage aging both with and without data
aggregation. Our results show that using an optimal mixture
of many inexpensive low-capability devices and some expensive
high-capability devices can significantly extend the duration of a
network’s sensing performance.},
}
@article{leibnitz2006biologically,
	author = {Leibnitz, Kenji and Wakamiya, Naoki and Murata, Masayuki},
	title = {{Biologically-Inspired Self-Adaptive Multi-Path Routing in Overlay Networks}},
	journal = {Communications of the ACM, Special Issue on Self-Managed Systems and Services},
	pages = {63-67},
	volume = {49},
	number = {3},
	year = {2006},
	month = {March},
}
@inproceedings{levis2003tossim,
	author = {Levis, Phil and Lee, Nelson and Welsh, Matt and Culler, David},
	title = {{TOSSIM: Accurate and Scalable Simulation of Entire TinyOS Applications}},
	booktitle = {ACM SensSys 2003},
	year = {2003},
	month = {November},
}
@inproceedings{levis2004emergence,
	author = {Levis, Philip and Madden, Sam and Gay, David and Polastre, Joe and Szewczyk, Robert and Woo, Alec and Brewer, Eric and Culler, David},
	title = {{The Emergence of Networking Abstractions and Techniques in TinyOS}},
	booktitle = {First USENIX/ACM Symposium on Networked Systems Design and Implementation (NSDI 2004)},
	year = {2004},
	month = {March},
	address = {San Francisco, CA, USA},
}
@techreport{li2004energy,
	author = {Li, Yuan and Ye, Wei and Heidemann, John},
	title = {{Energy and Latency Control in Low Duty Cycle MAC Protocols}},
	year = {2004},
	month = {August},
	institution = {USC/Information Sciences Institute},
	number = {ISI-TR-595},
	type = {Technical Report},
}
@inproceedings{liang1999predictive,
	author = {Liang, Ben and Haas, Zygmunt J.},
	title = {{Predictive distance-based mobility management for PCS networks}},
	booktitle = {18th IEEE Conference on Computer Communications (IEEE INFOCOM 1999)},
	year = {1999},
}
@inproceedings{liang1999ant,
	author = {Liang, Yun-Chia and Smith, Alice E.},
	title = {{An ant system approach to redundancy allocation}},
	booktitle = {IEEE Congress on Evolutionary Computation (CEC)},
	pages = {1478-1484},
	year = {1999},
	address = {Washington D.C.},
}
@article{lin1997adaptive,
	author = {Lin, Chunhung Richard and Gerla, Mario},
	title = {{Adaptive Clustering for Mobile Wireless Networks}},
	journal = {Selected Areas in Communications},
	pages = {1265-1275},
	volume = {15},
	number = {7},
	year = {1997},
	abstract = {This paper describes a self-organizing, multihop, mobile radio network, which relies on a code
division access scheme for multimedia support. In the proposed network architecture, nodes are
organized into nonoverlapping clusters. The clusters are independently controlled and are
dynamically reconfigured as nodes move. This network architecture has three main advantages.
First, it provides spatial reuse of the bandwidth due to node clustering. Secondly, bandwidth can
be shared or reserved in a controlled fashion in each cluster. Finally, the cluster algorithm is
robust in the face of topological changes caused by node motion, node failure and node insertion/
removal. Simulation shows that this architecture provides an efficient, stable infrastructure
for the integration of different types of traffic in a dynamic radio network.},
}
@inproceedings{lindsey2001data,
	author = {Lindsey, Stephanie and Raghavendra, Cauligi and Sivalingam, Krishna},
	title = {{Data Gathering in Sensor Networks using the Energy*Delay Metric}},
	booktitle = {15th International Parallel and Distributed Processing Symposium (IPDPS), Workshop on Issues in Wireless Networks and Mobile Computing},
	year = {2001},
	month = {April},
	address = {San Francisco, CA, USA},
	abstract = {In this paper we consider the problem of data collection from a sensor web consisting of
N nodes, where nodes have packets of data in each round of communication that need to be
gathered and fused with other nodes’ packets into one packet and transmitted to a distant
base station. Nodes have power control in their wireless communications and can transmit
directly to any node in the network or to the base station. With unit delay cost for each
packet transmission, if all nodes transmit data directly to the base station, then both high
energy and high delay per round will occur. In our prior work [6], we developed an
algorithm to minimize the energy cost per round, where a linear chain of all the nodes are
formed to gather data, and nodes took turns to transmit to the base station. If the goal is to
minimize the delay cost, then a binary combining scheme can be used to accomplish this
task in about log N units of delay with parallel communications and incurring a slight
increase in energy cost. The goal is to find data gathering schemes that balance the energy
and delay cost, as measured by energy*delay. We conducted extensive simulation
experiments with a number of schemes for this problem with 100 nodes in playing fields of
50m x 50m and 100m x 100m and the base station located at least 100 meters and 200
meters, respectively, from any node. With CDMA capable sensor nodes, a chain-based
binary scheme performs best in terms of energy*delay. If the sensor nodes are not CDMA
capable, then parallel communications are possible only among spatially separated nodes,
and a chain-based 3 level hierarchy scheme performs well. These schemes perform 60 to
100 times better than direct scheme and also outperform a cluster based scheme, called
LEACH.},
}
@article{lindsey2002data,
	author = {Lindsey, Stephanie and Raghavendra, Cauligi and Sivalingam, Krishna M.},
	title = {{Data Gathering Algorithms in Sensor Networks Using Energy Metrics}},
	journal = {IEEE Transactions on Parallel and Distributed Systems},
	pages = {924-935},
	volume = {13},
	number = {9},
	year = {2002},
	month = {September},
}
@inproceedings{lindsey2002pegasis,
	author = {Lindsey, Stephanie and Raghavendra, Cauligi S.},
	title = {{PEGASIS: Power Efficient GAthering in Sensor Information Systems}},
	booktitle = {IEEE Aerospace Conference,},
	year = {2002},
	address = {Big Sky, Montana, USA},
	abstract = {Sensor webs consisting of nodes with limited battery
power and wireless communications are deployed to collect
useful information from the field. Gathering sensed
information in an energy efficient manner is critical to
operate the sensor network for a long period of time. In [3]
a data collection problem is defined where, in a round of
communication, each sensor node has a packet to be sent
to the distant base station. If each node transmits its sensed
data directly to the base station then it will deplete its
power quickly. The LEACH protocol presented in [3] is an
elegant solution where clusters are formed to fuse data
before transmitting to the base station. By randomizing
the cluster heads chosen to transmit to the base station,
LEACH achieves a factor of 8 improvement compared to
direct transmissions, as measured in terms of when nodes
die. In this paper, we propose PEGASIS (Power-Efficient
GAthering in Sensor Information Systems), a near optimal
chain-based protocol that is an improvement over
LEACH. In PEGASIS, each node communicates only with
a close neighbor and takes turns transmitting to the base
station, thus reducing the amount of energy spent per
round. Simulation results show that PEGASIS performs
better than LEACH by about 100 to 300% when 1%, 20%,
50% , and 100% of nodes die for different network sizes
and topologies.},
}
@inproceedings{liu2005mobility,
	author = {Liu, Benyuan and Brass, Peter and Dousse, Olivier and Nain, Philippe and Towsley, Don},
	title = {{Mobility Improves Coverage of Sensor Networks}},
	booktitle = {6th ACM International Symposium on Mobile Ad Hoc Networking and Computing (ACM Mobihoc 2005)},
	pages = {300-308},
	year = {2005},
	month = {May},
	address = {Urbana-Champaign, IL},
}
@inproceedings{liu2006efficient,
	author = {Liu, Hai and Wan, Pengjun and Jia, Xiaohua and Liu, Xinxin and Yao, Frances},
	title = {{Efficient Flooding Scheme Based on 1-hop Information in Mobile Ad Hoc Networks}},
	booktitle = {25th IEEE Conference on Computer Communications (IEEE INFOCOM 2006)},
	year = {2006},
	month = {April},
	address = {Barcelona, Spain},
}
@article{lorincz2004sensor,
	author = {Lorincz, Konrad and Malan, David J. and Fulford-Jones, Thaddeus R.F. and Nawoj, Alan and Clavel, Antony and Shnayder, Victor and Mainland, Geoffrey and Welsh, Matt and Moulton, Steve},
	title = {{Sensor Networks for Emergency Response: Challenges and Opportunities}},
	journal = {IEEE Pervasive Computing},
	pages = {16-23},
	volume = {3},
	number = {4},
	year = {2004},
	month = {October-December},
}
@article{low2005autonomic,
	author = {Low, Kian Hsiang and Leow, Wee Kheng and Ang, Marcello H.},
	title = {{Autonomic Mobile Sensor Network with Self-Coordinated Task Allocation and Execution}},
	journal = {IEEE Transactions on Systems, Man, and Cypernetics--Part C: Applications and Reviews},
	pages = {315-327},
	volume = {36},
	number = {3},
	keywords = {task allocation, motion control, multi-robot architecture, swarm intelligence, self-organizing neural networks},
	year = {2005},
	month = {March},
	abstract = {The work in this paper describes a distributed
layered architecture for resource-constrained multi-robot cooperation,
which is utilized in autonomic mobile sensor network
coverage. In the upper layer, a dynamic task allocation scheme
self-organizes the robot coalitions to track efficiently across regions.
It uses concepts of ant behavior to self-regulate the regional
distributions of robots in proportion to that of the moving
targets to be tracked in a non-stationary environment. As a
result, the adverse effects of task interference between robots are
minimized and network coverage is improved. In the lower task
execution layer, the robots use self-organizing neural networks
to coordinate their target tracking within a region. Both layers
employ self-organization techniques, which exhibit autonomic
properties such as self-configuring, self-optimizing, self-healing,
and self-protecting. Quantitative comparisons with other tracking
strategies such as static sensor placements, potential fields, and
auction-based negotiation show that our layered approach can
provide better coverage, greater robustness to sensor failures,
and greater flexibility to respond to environmental changes.},
}
@inproceedings{lu2002rap,
	author = {Lu, Chenyang and Blum, Brian M. and Abdelzaher, Tarek F. and Stankovic, John A. and He, Tian},
	title = {{RAP: A Real-Time Communication Architecture for Large-Scale Wireless Sensor Networks}},
	booktitle = {8th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'02)},
	year = {2002},
	abstract = {Large-scale wireless sensor networks represent a new generation of real-time embedded systems with significantly different communication constraints from traditional networked systems. This paper presents RAP, a new real-time communication architecture forlarge-scale sensor networks. RAP provides convenient, high-level query and event services for distributed micro-sensing applications. Novel location-addressed communication models are supported by a scalable and light-weight network stack. We present and evaluate a new packet scheduling policy called velocity monotonic scheduling that inherently accounts for both time and distance constraints. We show that this policy is particularly suitable for communication scheduling in sensor networks in which a large number of wireless devices are seamlessly integrated into a physical space to perform real-time monitoring and control. Detailed simulations of representative sensor network environments demonstrate that RAP significantly reduces the end-to-end deadline miss ratio in the sensor network.},
}
@inproceedings{lu2005delay,
	author = {Lu, Gang and Sadagopan, Narayanan and Krishnamachari, Bhaskar and Goel, Ashish},
	title = {{Delay Efficient Sleep Scheduling in Wireless Sensor Networks}},
	booktitle = {24th IEEE Conference on Computer Communications (IEEE INFOCOM 2005)},
	year = {2005},
	month = {March},
	address = {Miami, FL, USA},
}
@article{luo2004pilot,
	author = {Luo, Jun and Eugster, Patrick Th. and Hubaux, Jean-Pierre},
	title = {{Pilot: Probabilistic Lightweight Group Communication System for Ad Hoc Networks}},
	journal = {IEEE Transactions on Mobile Computing},
	pages = {164-179},
	volume = {3},
	number = {2},
	year = {2004},
	month = {April},
}
@techreport{luo2004survey,
	author = {Luo, Jun and Hubaux, Jean-Pierre},
	title = {{A Survey of Inter-Vehicle Communication}},
	year = {2004},
	institution = {School of Computer and Communication Sciences, EPFL},
	number = {IC/2004/24},
	type = {Technical Report},
}
@inproceedings{macqueen1967methods,
	author = {MacQueen, J.},
	title = {{Some Methods for Classification and Analysis of Multivariate Observations}},
	booktitle = {Berkeley Symposium on Mathematical Statistics and Probability},
	pages = {281-297},
	year = {1967},
	address = {Berkeley},
	publisher = {University of California Press},
}
@article{madden2005tinydb,
	author = {Madden, Samuel R. and Franklin, Michael J. and Hellerstein, Joseph M. and Hong, Wei},
	title = {{TinyDB: An Acquisitional Query Processing System for Sensor Networks}},
	journal = {ACM Transactions on Database Systems (TODS)},
	pages = {122-173},
	volume = {30},
	number = {1},
	year = {2005},
	month = {March},
}
@inproceedings{mainwaring2002wireless,
	author = {Mainwaring, Alan and Polastre, Joseph and Szewczyk, Robert and Culler, David and Anderson, John},
	title = {{Wireless Sensor Networks for Habitat Monitoring}},
	booktitle = {First ACM Workshop on Wireless Sensor Networks and Applications},
	year = {2002},
	month = {September},
	address = {Atlanta, GA, USA},
}
@techreport{margi2003survey,
	author = {Margi, Cintia},
	title = {{A Survey on Networking, Sensor Processing and System Aspects of Sensor Networks}},
	year = {2003},
	month = {February},
	institution = {University of California, Santa Cruz},
	type = {Report},
}
@article{martin1999open,
	author = {Martin, David and Cheyer, Adam and Moran, Douglas},
	title = {{The Open Agent Architecture: a framework for building distributed software systems}},
	journal = {Applied Artificial Intelligence},
	pages = {91-128},
	volume = {13},
	number = {1/2},
	year = {1999},
	abstract = {The Open Agent Architecture (OAA), developed and used for several years at SRI
International, makes it possible for software services to be provided through the co-
operative e
orts of distributed collections of autonomous agents. Communication and
cooperation between agents are brokered by one or more facilitators, which are respon-
sible for matching requests, from users and agents, with descriptions of the capabilities
of other agents. Thus, it is not generally required that a user or agent know the iden-
tities, locations, or number of other agents involved in satisfying a request. OAA is
structured so as to minimize the e
ort involved in creating new agents and \wrapping"
legacy applications, written in various languages and operating on various platforms;
to encourage the reuse of existing agents; and to allow for dynamism and exibility in
the makeup of agent communities. Distinguishing features of OAA as compared with
related work include extreme exibility in using facilitator-based delegation of complex
goals, triggers, and data management requests; agent-based provision of multimodal
user interfaces; and built-in support for including the user as a privileged member of
the agent community.
This paper explains the structure and elements of agent-based systems constructed
using OAA. The characteristics and use of each major component of OAA infrastructure
are described, including the agent library, the Interagent Communication Language,
capabilities declarations, service requests, facilitation, management of data repositories,
and autonomous monitoring using triggers. To provide technical context, we describe
the motivations for OAA's design, and situate its features within the realm of alternative
software paradigms. A summary is given of OAA-based systems built to date, and brief
descriptions are given of several of these.},
}
@article{mataric1995designing,
	author = {Mataric, Maja J.},
	title = {{Designing and Understanding Adaptive Group Behavior}},
	journal = {Adaptive Behavior},
	pages = {51-80},
	volume = {4},
	number = {1},
	year = {1995},
	month = {December},
}
@article{mataric1995issues,
	author = {Mataric, Maja J.},
	title = {{Issues and Approaches in the Design of Collective Autonomous Agents}},
	journal = {Robotics and Autonomous Systems},
	pages = {321-331},
	volume = {16},
	number = {2},
	year = {1995},
	month = {December},
}
@article{mataric2003multi-robot,
	author = {Mataric, Maja J. and Sukhatme, Gaurav S. and Ostergaard, Esben H.},
	title = {{Multi-Robot Task Allocation in Uncertain Environments}},
	journal = {Autonomous Robots},
	pages = {255-263},
	volume = {14},
	year = {2003},
}
@article{mauve2001survey,
	author = {Mauve, Martin and Widmer, J\"{o}rg},
	title = {{A Survey on Position-Based Routing in Mobile Ad-Hoc Networks}},
	journal = {IEEE Network},
	pages = {30-39},
	volume = {15},
	number = {6},
	year = {2001},
	abstract = {We present an overview of ad-hoc routing protocols that make forwarding decisions based on the geographical position of a packet's destination. Other than the destination's position, each node needs to know only its own position and the position of its one-hop neighbors in order to forward packets. Since it is not necessary to maintain explicit routes, position-based routing does scale well even if the network is highly dynamic. This is a major advantage in a mobile ad-hoc network where the topology may change frequently. The main prerequisite for position-based routing is that a sender can obtain the current position of the destination. Therefore, recently proposed location services are discussed in addition to position-based packet forwarding strategies. We provide a qualitative comparison of the approaches in both areas and investigate opportunities for future research.},
}
@inproceedings{meguerdichian2001coverage,
	author = {Meguerdichian, Seapahn and Koushanfar, Farinaz and Potkonjak, Miodrag and Srivastava, Mani B.},
	title = {{Coverage Problems in Wireless Ad-hoc Sensor Networks}},
	booktitle = {20th IEEE Conference on Computer Communications (IEEE INFOCOM 2001)},
	pages = {1380-1387},
	year = {2001},
	month = {April},
	address = {Ankorange, Alaska, USA},
}
@inproceedings{meguerdichian2001localized,
	author = {Meguerdichian, Seapahn and Slijepcevic, Sasa and Karayan, Vahag and Potkonjak, Miodrag},
	title = {{Localized algorithms in wireless ad-hoc networks: location discovery and sensor exposure}},
	booktitle = {2nd ACM International Symposium on Mobile Ad Hoc Networking and Computing (ACM MobiHoc 2001)},
	pages = {106-116},
	year = {2001},
	month = {October},
	address = {Long Beach, CA, USA},
	abstract = {The development of practical, localization algorithms is probably the most needed and most challenging task in wireless ad-hoc sensor networks (WASNs). Localized algorithms are a special type of distributed algorithms where only a subset of nodes in the WASN participate in sensing, communication, and computation. We have developed a generic localized algorithm for solving optimization problems in wireless ad-hoc networks that has five components: (i) data acquisition mechanism, (ii) optimization mechanism, (iii) search expansion rules, (iv) bounding conditions and (v) termination rules. the main idea is to request and process data only locally and only from nodes who are likely to contribute to rapid formation of the final solution. The approach enables two types of optimization: The first, guarantees the fraction of nodes that are contacted while optimizing for solution quality. The second, provides guarantees on solution qualities while minimizing the number of nodes that are contacted and/or amount of communication. The localized optimization approach is applied to two fundamental problems in sensor networks: location discovery and exposure-based coverage. We demonstrate its effective-ness on a number of examples},
}
@inproceedings{melodia2006communication,
	author = {Melodia, Tommaso and Pompili, Dario and Akyildiz, Ian F.},
	title = {{A Communication Architecture for Mobile Wireless Sensor and Actor Networks}},
	booktitle = {IEEE SECON 2006},
	year = {2006},
	month = {September},
	address = {Reston, VA},
}
@inproceedings{melodia2005distributed,
	author = {Melodia, Tommaso and Pompili, Dario and Gungor, Vehbi C. and Akyildiz, Ian F.},
	title = {{A Distributed Coordination Framework for Wireless Sensor and Actor Networks}},
	booktitle = {6th ACM International Symposium on Mobile Ad Hoc Networking and Computing (ACM Mobihoc 2005)},
	pages = {99-110},
	year = {2005},
	month = {May},
	address = {Urbana-Champaign, Il, USA},
}
@article{melodia2007communication,
	author = {Melodia, Tommaso and Pompili, Dario and Gungor, Vehbi C. and Akyildiz, Ian F.},
	title = {{Communication and Coordination in Wireless Sensor and Actor Networks}},
	journal = {IEEE Transactions on Mobile Computing},
	year = {2007},
}
@article{mhatre2004design,
	author = {Mhatre, Vivek and Rosenberg, Catherine},
	title = {{Design guidelines for wireless sensor networks: communication, clustering and aggregation}},
	journal = {Elsevier Ad Hoc Networks},
	pages = {45-63},
	volume = {2},
	number = {1},
	keywords = {Wireless sensor networks, Clustering, Single hop vs multi-hop, Data aggregation},
	year = {2004},
	month = {January},
	abstract = {When sensor nodes are organized in clusters, they could use either single hop or multi-hop mode of communication to send their data to their respective cluster heads. We present a systematic cost-based analysis of both the modes, and provide results that could serve as guidelines to decide which mode should be used for given settings. We determine closed form expressions for the required number of cluster heads and the required battery energy of nodes for both the modes. We also propose a hybrid communication mode which is a combination of single hop and multi-hop modes, and which is more cost-effective than either of the two modes. Our problem formulation also allows for the application to be taken into account in the overall design problem through a data aggregation model.},
}
@article{mills1990accuracy,
	author = {Mills, D. L.},
	title = {{On the Accuracy and Stability of Clocks Synchronized by the Network Time Protocol in the Internet System}},
	journal = {ACM Computer Communications Review},
	pages = {65-75},
	volume = {20},
	number = {1},
	year = {1990},
	month = {January},
}
@article{mills1991internet,
	author = {Mills, D. L.},
	title = {{Internet Tme Synchronization: the Network Time Protocol}},
	journal = {IEEE/ACM Transactions on Networking (TON)},
	pages = {1482-1493},
	volume = {39},
	number = {10},
	year = {1991},
	month = {October},
}
@article{milnor1985concept,
	author = {Milnor, John},
	title = {{On the concept of attractor}},
	journal = {Communications in Mathematical Physics},
	pages = {177-195},
	volume = {99},
	number = {2},
	year = {1985},
}
@inproceedings{mochocki2005h-mas,
	author = {Mochocki, Bren C and Madey, Gregory R},
	title = {{H-MAS: A Heterogeneous, Mobile, Ad-hoc Sensor-Network Simulation Environment}},
	booktitle = {Agent-Directed Simulation Conference},
	year = {2005},
	address = {San Diego, CA},
	abstract = {Ad-hoc Sensor Networks are a feasible and rapidly deployable
solution to many common environment monitoring applications. In
traditional sensor network design, each unit is capable sensing,
processing and storing its own local data, as well as using a multi-hop
forwarding scheme to send this data to off-network storage. Thus,
each network element must fill at least four different rolls: sensing,
processing, communication, and storage, each of which may be
further subdivided. As nano-scale miniaturization becomes feasible,
including complete homogeneous functionality at each node will
become an increasingly difficult problem. Pico-radio devices provide
a platform by which these responsibilities can be offloaded to
different nodes, but still remain accessible through wireless
communication.
We have developed a conceptual pico-radio sensor network
system, and a corresponding design simulation and evaluation
environment, H-MAS, that separates the tasks of processing and
storage from the sensor nodes. Through agent-based computer
simulation using the SWARM toolkit, we will compare the
effectiveness of current medium access, routing, organization, and
energy conservation techniques on H-MAS, and derive several
heuristics and design rules for various network configurations. The
visualization side of H-MAS also provides a convenient way to
present the design of MAS systems to non-technical personnel.},
}
@article{moore1965cramming,
	author = {Moore, Gordon E.},
	title = {{Cramming more components onto integrated circuits}},
	journal = {Electronics},
	pages = {114-117},
	volume = {38},
	year = {1965},
	month = {April},
}
@inproceedings{moritani2005molecular,
	author = {Moritani, Yuki and Hiyama, Satoshi and Suda, Tatsuya and Egashira, Ryota and Enomoto, Akihiro and Moore, Michael and Nakano, Tadsdhi},
	title = {{Molecular Communications between Nanomachines}},
	booktitle = {24th IEEE Conference on Computer Communications (IEEE INFOCOM 2005)},
	year = {2005},
	month = {March},
	address = {Miami, FL, USA},
}
@inproceedings{muraleedharan2003sensor,
	author = {Muraleedharan, Rajani and Osadciw, Lisa Ann},
	title = {{Sensor Communication Network Using Swarm Intelligence}},
	booktitle = {2nd IEEE Upstate New York Workshop on Sensor Networks},
	year = {2003},
	month = {October},
	address = {Syracuse, NY, USA},
}
@inproceedings{muraleedharan2003balancing,
	author = {Muraleedharan, Rajani and Osadciw, Lisa Ann},
	title = {{Balancing The Performance of a Sensor Network Using an Ant System}},
	booktitle = {37th Annual Conference on Information Sciences and Systems (CISS 2003)},
	year = {2003},
	month = {March},
	address = {Baltimore, MD},
}
@article{murthy1996efficient,
	author = {Murthy, Shree and Garcia-Luna-Aceves, J. J.},
	title = {{An Efficient Routing Protocol for Wireless Networks}},
	journal = {ACM Mobile Networks and Applications, Special issue on Routing in Mobile Communication Networks},
	pages = {83-197},
	year = {1996},
	url = {citeseer.ist.psu.edu/murthy96efficient.html},
}
@inproceedings{navas1997geocast,
	author = {Navas, Julio C. and Imielinski, Tomasz},
	title = {{GeoCast - geographic addressing and routing}},
	booktitle = {3rd ACM International Conference on Mobile Computing and Networking (ACM MobiCom 1997)},
	pages = {66-76},
	year = {1997},
	address = {Budapest, Hungary},
}
@inproceedings{nesargi2002manetconf,
	author = {Nesargi, Sanket and Prakash, Ravi},
	title = {{MANETconf: Configuration of Hosts in a Mobile Ad Hoc Network}},
	booktitle = {21st IEEE Conference on Computer Communications (IEEE INFOCOM 2002)},
	pages = {1059-1068},
	volume = {2},
	year = {2002},
}
@inproceedings{ni1999broadcast,
	author = {Ni, Sze-Yao and Tseng, Yu-Chee and Chen, Yuh-Shyan and Sheu, Jang-Ping},
	title = {{The Broadcast Storm Problem in a Mobile Ad Hoc Network}},
	booktitle = {5th ACM International Conference on Mobile Computing and Networking (ACM MobiCom 1999)},
	pages = {151-162},
	year = {1999},
	month = {August},
	address = {Seattle, Washington},
}
@inproceedings{noury2001monitoring,
	author = {Noury, N. and Herve, T. and Rialle, V. and Virone, G. and Mercier, E.},
	title = {{Monitoring behavior in home using a smart fall sensor network and position sensors}},
	booktitle = {1st EMBS Special Topic Conference on Microtechnology in Medicine and Biology},
	pages = {607-617},
	year = {2001},
	month = {October},
	publisher = {IEEE Computer Society Press},
}
@inproceedings{olariu2006design,
	author = {Olariu, Stephan and Stojmenovic, Ivan},
	title = {{Design guidelines for maximizing lifetime and avoiding energy holes in sensor networks with uniform distribution and uniform reporting}},
	booktitle = {25th IEEE Conference on Computer Communications (IEEE INFOCOM 2006)},
	year = {2006},
	month = {April},
	address = {Barcelona, Spain},
	abstract = {This paper investigates theoretical aspects of
the uneven energy depletion phenomenon recently noticed
in sink-based wireless sensor networks. We consider uniformly
distributed sensors, each sending roughly the same
number of reports toward the closest sink. We assume
an energy consumption model governed by the relation
E = d$\alpha$+c where d, (d ≤ tx), is the transmission distance,
$\alpha$ ≥ 2 is the power attenuation, c is a technology-dependent
positive constant, and tx is the maximum transmission
range of sensors. Our results are multifold. First, we show
that for $\alpha$ > 2, all sensors whose distance to the sink
is min{tx, ( 2c
$\alpha$−2 ) 1
$\alpha$ } should transmit directly to the sink.
Interestingly, this limit does not depend on the size of the
network, expressed as the largest distance R from a sensor
to the closest sink. Next, we prove that in order to minimize
the total amount of energy spent on routing along a path
originating at a sensor in a corona and ending at the sink,
all the coronas must have the same width, equal to the
above expression. This choice, however, leads to uneven
energy depletion and to the creation of energy holes. We
show that for $\alpha$ > 2 the uneven energy depletion can be
prevented by judicious system design, resulting in balanced
energy expenditure across the network. We describe an
iterative process for determining the sizes of coronas.
Their optimal sizes (and corresponding transmission radii)
and the number of coronas depend on R. As expected,
the width of coronas in energy-balanced sensor network
increases. Finally, we show that for $\alpha$ = 2, the uneven
energy depletion phenomenon is intrinsic to the system
and no routing strategy can avoid the creation of an energy
hole around the sink.},
}
@inproceedings{opp2004artificial,
	author = {Opp, W. J. and Sahin, F.},
	title = {{An artificial immune system approach to mobile sensor networks and min detection}},
	booktitle = {IEEE International Conference on Systems, Man and Cybernetics},
	pages = {947-952},
	volume = {1},
	year = {2004},
	month = {October},
	address = {The Hague, The Netherlands},
}
@inproceedings{parker1994alliance,
	author = {Parker, Lynne E.},
	title = {{ALLIANCE: An Architecture for Fault Tolerant, Cooperative Control of Heterogeneous Mobile Robots}},
	booktitle = {IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 1994)},
	pages = {776-783},
	year = {1994},
	month = {September},
}
@article{parker1998alliance,
	author = {Parker, Lynne E.},
	title = {{ALLIANCE: An Architecture for Fault Tolerant Multirobot Cooperation}},
	journal = {IEEE Transactions on Robotics and Automation},
	pages = {220-240},
	volume = {14},
	number = {2},
	year = {1998},
	month = {April},
}
@phdthesis{patchipulusu2001dynamic,
	author = {Patchipulusu, P.},
	title = {{Dynamic address allocation protocols for mobile ad hoc networks}},
	year = {2001},
	month = {August},
	school = {Texas AM University},
	type = {Master's Thesis},
}
@inproceedings{paul1999communication-aware,
	author = {Paul, K. and Bandyopadhyay, S. and Mukherjee, A. and Saha, D.},
	title = {{Communication-Aware Mobile Hosts in Ad-hoc Wireless Network}},
	booktitle = {IEEE International Conference on Personal Wireless Communication (ICPWC 1999)},
	pages = {83-87},
	year = {1999},
	month = {February},
	address = {Jaipur, India},
}
@article{pawson1995protein,
	author = {Pawson, T.},
	title = {{Protein modules and signalling networks}},
	journal = {Nature},
	pages = {573-80},
	volume = {373},
	number = {6515},
	keywords = {Amino Acid Sequence, Animals, Binding Sites, Blood Proteins/physiology, Cell Communication/*physiology, Human, Molecular Sequence Data, *Phosphoproteins, Protein Binding, Proteins/*physiology, Proto-Oncogene Protein pp60(c-src)/physiology, Receptors, Cell Surface/physiology, Signal Transduction/*physiology},
	year = {1995},
	month = {February},
	abstract = {Communication between cells assumes particular importance in multicellular organisms. The growth, migration and differentiation of cells in the embryo, and their organization into specific tissues, depend on signals transmitted from one cell to another. In the adult, cell signalling orchestrates normal cellular behaviour and responses to wounding and infection. The consequences of breakdowns in this signalling underlie cancer, diabetes and disorders of the immune and cardiovascular systems. Conserved protein domains that act as key regulatory participants in many of these different signalling pathways are highlighted.},
}
@inproceedings{pei2000lanmar,
	author = {Pei, Guangyu and Gerla, Mario and Hong, Xiaoyan},
	title = {{LANMAR: Landmark Routing for Large Scale Wireless Ad Hoc Networks withGroup Mobility}},
	booktitle = {1st ACM International Symposium on Mobile Ad Hoc Networking and Computing (ACM Mobihoc 2000)},
	pages = {64-75},
	year = {2000},
	address = {Boston, MA},
	abstract = {In this paper, we present a novel routing protocol for wireless
ad hoc networks – Landmark Ad Hoc Routing (LANMAR). LANMAR combines
the features of Fisheye State Routing (FSR) and Landmark routing.
The key novelty is the use of landmarks for each set of nodes which move as
a group (e.g., a team of co-workers at a convention or a tank battalion in the
battlefield) in order to reduce routing update overhead. Like in FSR, nodes
exchange link state only with their neighbors. Routes within Fisheye scope
are accurate, while routes to remote groups of nodes are “summarized” by
the corresponding landmarks. A packet directed to a remote destination initially
aims at the Landmark; as it gets closer to destination it eventually
switches to the accurate route provided by Fisheye. Simulation experiments
show that LANMAR provides efficient and scalable routing in large, mobile,
ad hoc environments in which group mobility applies.},
}
@inproceedings{perkins1999adhoc,
	author = {Perkins, Charles E. and Royer, Elizabeth M.},
	title = {{Ad hoc On-Demand Distance Vector Routing}},
	booktitle = {2nd IEEE Workshop on Mobile Computing Systems and Applications},
	pages = {90-100},
	year = {1999},
	month = {February},
	address = {New Orleans, LA},
}
@article{perkins1994highly,
	author = {Perkins, Charles E. and Bhagwat, Pravin},
	title = {{Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers}},
	journal = {Computer Communications Review},
	pages = {234-244},
	year = {1994},
	abstract = {An ad-hoc network is the cooperative engagement of
a collection of Mobile Hosts without the required intervention
of any centralized Access Point. In this paper
we present an innovative design for the operation of such
ad-hoc networks. The basic idea of the design is to operate
each Mobile Host as a specialized router, which
periodically advertises its view of the interconnection
topology with other Mobile Hosts within the network.
This amounts to a new sort of routing protocol. We
have investigated modifications to the basic Bellman-
Ford routing mechanisms, as specified by RIP [5], to
make it suitable for a dynamic and self-starting network
mechanism as is required by users wishing to utilize adhoc
networks. Our modifications address some of the
previous objections to the use of Bellman-Ford, related
to the poor looping properties of such algorithms in the
face of broken links and the resulting time dependent
nature of the interconnection topology describing the
links between the Mobile Hosts. Finally, we describe
the ways in which the basic network-layer routing can
be modified to provide MAC-layer support for ad-hoc
networks.},
}
@inproceedings{pleisch2006mistral,
	author = {Pleisch, Stefan and Balakrishnan, Mahesh and Birman, Ken and van Renesse, Robbert},
	title = {{MISTRAL: Efficient Flooding in Mobile Adhoc Networks}},
	booktitle = {7th ACM International Symposium on Mobile Ad Hoc Networking and Computing (ACM MobiHoc 2006)},
	year = {2006},
	month = {May},
	address = {Florence, Italy},
}
@article{prehofer2005self-organization,
	author = {Prehofer, Christian and Bettstetter, Christian},
	title = {{Self-Organization in Communication Networks: Principles and Design Paradigms}},
	journal = {IEEE Communications Magazine},
	pages = {78-85},
	volume = {43},
	number = {7},
	year = {2005},
	month = {July},
}
@inproceedings{priyantha2005mobile-assisted,
	author = {Priyantha, Nissanka B. and Balakrishnan, Hari and Demaine, Erik D. and Teller, Seth},
	title = {{Mobile-Assisted Localization in Wireless Sensor Networks}},
	booktitle = {24th IEEE Conference on Computer Communications (IEEE INFOCOM 2005)},
	year = {2005},
	month = {March},
	address = {Miami, FL, USA},
}
@inproceedings{qi2001multisensor,
	author = {Qi, Hairong and Wang, Xiaoling and Iyengar, S. Sitharama and Chakrabarty, Krishnendu},
	title = {{Multisensor Data Fusion in Distributed Sensor Networks Using Mobile Agents}},
	booktitle = {International Conference on Information Fusion},
	pages = {11-16},
	year = {2001},
	month = {August},
}
@article{raghunathan2002energy-aware,
	author = {Raghunathan, Vijay and Schurgers, Curt and Park, Sung and Srivastava, Mani B.},
	title = {{Energy-aware wireless microsensor networks}},
	journal = {IEEE Signal Processing Magazine},
	pages = {40-50},
	volume = {19},
	number = {2},
	keywords = {microsensors, optimisation, power consumption, protocols, radio networks},
	year = {2002},
	month = {March},
	abstract = {This article describes architectural and algorithmic approaches that designers can use to enhance the energy awareness of wireless sensor networks. The article starts off with an analysis of the power consumption characteristics of typical sensor node architectures and identifies the various factors that affect system lifetime. We then present a suite of techniques that perform aggressive energy optimization while targeting all stages of sensor network design, from individual nodes to the entire network. Maximizing network lifetime requires the use of a well-structured design methodology, which enables energy-aware design and operation of all aspects of the sensor network, from the underlying hardware platform to the application software and network protocols. Adopting such a holistic approach ensures that energy awareness is incorporated not only into individual sensor nodes but also into groups of communicating nodes and the entire sensor network. By following an energy-aware design methodology based on techniques such as in this article, designers can enhance network lifetime by orders of magnitude},
}
@inproceedings{rahimi2003studying,
	author = {Rahimi, Mohammad and Shah, Hardik and Sukhatme, Gaurav S. and Heidemann, John and Estrin, Deborah},
	title = {{Studying the Feasibility of Energy Harvesting in a Mobile Sensor Network}},
	booktitle = {IEEE International Conference on Robotics and Automation (ICRA 2003)},
	pages = {19-24},
	year = {2003},
	month = {September},
}
@article{rajagopalan2006data-aggregation,
	author = {Rajagopalan, Ramesh and Varshney, Pramod K.},
	title = {{Data-Aggregation Techniques in Sensor Networks: A Survey}},
	journal = {IEEE Communication Surveys and Tutorials},
	pages = {48-63},
	volume = {8},
	number = {4},
	year = {2006},
	month = {December},
}
@article{rajaraman2002topology,
	author = {Rajaraman, Rajmohan},
	title = {{Topology control and routing in ad hoc networks: a survey}},
	journal = {ACM SIGACT News},
	pages = {60-73},
	volume = {33},
	number = {2},
	year = {2002},
	month = {June},
}
@inproceedings{rauenbusch2002mediation,
	author = {Rauenbusch, Timothy William},
	title = {{The Mediation Algorithm for Real Time Negotiation}},
	booktitle = {First International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS'02), Poster Session},
	pages = {1139-1140},
	year = {2002},
	month = {July},
	address = {Bologna, Italy},
}
@phdthesis{rauenbusch2004measuring,
	author = {Rauenbusch, Timothy William},
	title = {{Measuring Information Transmission for Team Decision Making}},
	year = {2004},
	month = {May},
	location = {Cambridge, MA},
	school = {Hardvard University},
	type = {Ph.D Thesis},
}
@inproceedings{reichardt2002cartalk,
	author = {Reichardt, Dirk and Miglietta, Maurizio and Moretti, Lino and Morsink, Peter and Schulz, Wolfgang},
	title = {{CarTALK 2000 - Safe and Comfortable Driving Based Upon Inter-Vehicle-Communication}},
	booktitle = {IEEE Intelligent Vehicle Symposium},
	pages = {545-550},
	volume = {2},
	year = {2002},
	month = {June},
	address = {Versailles},
}
@inproceedings{roemer2001time,
	author = {R\"{o}mer, Kay},
	title = {{Time Synchronization in Ad Hoc Networks}},
	booktitle = {2nd ACM International Symposium on Mobile Ad Hoc Networking and Computing (ACM Mobihoc 2001)},
	pages = {173-182},
	year = {2001},
	month = {October},
	address = {Long Beach, USA},
}
@inproceedings{royer2000implementation,
	author = {Royer, Elizabeth M. and Perkins, Charles E.},
	title = {{An Implementation Study of the AODV Routing Protocol}},
	booktitle = {IEEE Wireless Communications and Networking Conference},
	year = {2000},
	month = {September},
	address = {Chicago, IL},
}
@inproceedings{sadagopan2003acquire,
	author = {Sadagopan, Narayanan and Krishnamachari, Bhaskar and Helmy, Ahmed},
	title = {{The ACQUIRE mechanism for efficient querying in sensor networks}},
	booktitle = {First International Workshop on Sensor Network Protocol and Applications},
	year = {2003},
	address = {Anchorage, Alaska},
	abstract = {We propose a novel and efficient mechanism for
obtaining information in sensor networks which we refer to as
ACQUIRE. In ACQUIRE an active query is forwarded through
the network, and intermediate nodes use cached local information
(within a look-ahead of d hops) in order to partially resolve the
query. When the query is fully resolved, a completed response is
sent directly back to the querying node.
We take a mathematical modelling approach in this paper
to calculate the energy costs associated with ACQUIRE. The
models permit us to characterize analytically the impact of
critical parameters, and compare the performance of ACQUIRE
with respect to alternatives such as flooding-based querying
(FBQ) and expanding ring search (ERS). We show that with
optimal parameter settings, depending on the update frequency,
ACQUIRE obtains order of magnitude reduction over FBQ and
potentially over 60% reduction over ERS in consumed energy.},
}
@inproceedings{salhieh2002power,
	author = {Salhieh, Ayad and Schwiebert, Loren},
	title = {{Power Aware Metrics for Wireless Sensor Networks}},
	booktitle = {14th IASTED Conference on Parallel and Distributed Computing and Systems (PDCS 2002)},
	pages = {326-331},
	year = {2002},
	month = {November},
	address = {Boston, Massachusetts},
}
@inproceedings{sankarasubramaniam2003esrt,
	author = {Sankarasubramaniam, Yogesh and Akan, \"{O}zg\"{u}r B. and Akyildiz, Ian F.},
	title = {{ESRT: Event-to-Sink Reliable Transport in Wireless Sensor Networks}},
	booktitle = {4th ACM International Symposium on Mobile Ad Hoc Networking and Computing (ACM Mobihoc 2003)},
	pages = {177-188},
	year = {2003},
	month = {June},
	address = {Annapolis, Maryland, USA},
}
@inproceedings{sasson2002probabilistic,
	author = {Sasson, Yoav and Cavin, David and Schiper, Andr\'{e}},
	title = {{Probabilistic Broadcast for Flooding in Wireless Mobile Ad hoc Networks}},
	booktitle = {IEEE WCNC 2003},
	year = {2002},
}
@article{schulzrinne2003ubiquitous,
	author = {Schulzrinne, Henning and Wu, Xiaotao and Sidiroglou, Stylianos and Berger, Stefan},
	title = {{Ubiquitous Computing in Home Networks}},
	journal = {IEEE Communications Magazine},
	pages = {128-135},
	volume = {41},
	number = {11},
	year = {2003},
	month = {November},
}
@inproceedings{scott2004dynamic,
	author = {Scott, Donald J. and Yasinsac, Alec},
	title = {{Dynamic Probabilistic Retransmission in Ad hoc Networks}},
	booktitle = {International Conference on Wireless Networks (ICWN 2004)},
	pages = {158-164},
	year = {2004},
	month = {June},
	address = {Las Vegas, Nevada, USA},
}
@inproceedings{shah2006real-time,
	author = {Shah, Ghalib A. and Bozyigit, Muslim and Akan, \"{O}zg\"{u}r B. and Baykal, Buyurman},
	title = {{Real-Time Coordination and Routing in Wireless Sensor and Actor Networks}},
	booktitle = {6th International Conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking (NEW2AN 2006)},
	year = {2006},
	month = {May},
	address = {St. Petersburg, Russia},
}
@inproceedings{shah2003data,
	author = {Shah, Rahul C. and Roy, Sumit and Jain, Sushant and Brunette, Waylon},
	title = {{Data MULEs: Modeling a Three-tier Architecture for Sparse Sensor Networks}},
	booktitle = {First IEEE International Workshop on Sensor Network Protocols and Applications (SNPA'03)},
	pages = {30-41},
	year = {2003},
	month = {May},
	abstract = {This paper presents and analyzes an architecture
to collect sensor data in sparse sensor networks. Our approach
exploits the presence of mobile entities (called MULEs) present in
the environment. MULEs pick up data from the sensors when in
close range, buffer it, and drop off the data to wired access points.
This can lead to substantial power savings at the sensors as they
only have to transmit over a short range. This paper focuses on a
simple analytical model for understanding performance as system
parameters are scaled. Our model assumes two-dimensional
random walk for mobility and incorporates key system variables
such as number of MULEs, sensors and access points. The
performance metrics observed are the data success rate (the
fraction of generated data that reaches the access points) and the
required buffer capacities on the sensors and the MULEs. The
modeling along with simulation results can be used for further
analysis and provide certain guidelines for deployment of such
systems.},
}
@inproceedings{shah2005when,
	author = {Shah, Rahul C. and Wieth\"{o}lter, Sven and Wolisz, Adam},
	title = {{When does opportunistic routing make sense?}},
	booktitle = {First International Workshop on Sensor Networks and Systems for Pervasive Computing (PerSeNS 2005)},
	year = {2005},
	month = {March},
	address = {Kauai Island, USA},
	abstract = {Different opportunistic routing protocols have been proposed
recently for routing in sensor networks. These protocols
exploit the redundancy among nodes by using a node
that is available for routing at the time of packet transmission.
This mitigates the effect of varying channel conditions
and duty cycling of nodes that make static selection of
routes not viable. However, there is a downside as each hop
may provide extremely small progress towards the destination
or the signaling overhead for selecting the forwarding
node may be too large. In this paper, we provide a systematic
performance evaluation, taking into account different
node densities, channel qualities and traffic rates to identify
the cases when opportunistic routing makes sense. The metrics
we use are power consumption at the nodes, average
delay suffered by packets and goodput of the protocol. Our
baseline for comparison is geographic routing with nodes
being duty cycled to conserve energy. The paper also identifies
optimal operation points for opportunistic routing that
minimizes the power consumption at nodes.},
}
@inproceedings{shah2005modelling,
	author = {Shah, R. C. and Wieth\"{o}lter, S. and Wolisz, A. and Rabaey, J. M.},
	title = {{Modelling and analysis of opportunistic routing in low traffic scenarios}},
	booktitle = {3rd International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05)},
	year = {2005},
	address = {Trento, Italy},
}
@inproceedings{shen2006grid,
	author = {Shen, Xingfa and Chen, Jiming and Wang, Zhi and Sun, Youxian},
	title = {{Grid Scan: A Simple and Effective Approach for Coverage Issue in Wireless Sensor Networks}},
	booktitle = {IEEE International Conference on Communications (IEEE ICC 2006)},
	year = {2006},
	month = {June},
	address = {Istanbul, Turkey},
	abstract = {This paper describes a basic coverage issue, and
proposes a scheme named Grid Scan which is applied to
calculate the basic coverage rate with arbitrary sensing radius
of each node. Based on Grid Scan, re-deployment approach is
suggested to meet any k-covered rate in some region according
to application requirements. The objective of our re-deployment
is to get equivalent coverage rate using less number of sensor
nodes or to achieve higher coverage rate with the same number
of sensor nodes. The results of simulation experiments support
that Grid Scan based re-deployment is more effective to cover
monitored area than random spread.},
}
@article{singh1994electing,
	author = {Singh, S. and Kurose, J.},
	title = {{Electing 'good' leaders}},
	journal = {Journal of Parallel and Distributed Computing},
	pages = {184-201},
	volume = {21},
	number = {2},
	year = {1994},
	month = {May},
}
@inproceedings{singh1998power-aware,
	author = {Singh, Suresh and Woo, Mike and Raghavendra, C. S.},
	title = {{Power-aware routing in mobile ad hoc networks}},
	booktitle = {4th ACM International Conference on Mobile Computing and Networking (ACM MobiCom 1998)},
	pages = {181-190},
	year = {1998},
	address = {Dallas, Texas, United States},
	abstract = {In this paper we present a case for using new power-aware
metrics for determining routes in wireless ad hoc networks.
We present five different metrics based on battery power
consumption at nodes. We show that using these metrics
in a shortest-cost routing algorithm reduces the cost/packet
of routing packets by 5-30% over shortest-hop routing (this
cost reduction is on top of a 40-70% reduction in energy con-
sumption obtained by using PAMAS, our MAC layer pro-
tocol). Furthermore, using these new metrics ensures that
the mean time to node failure is increased significantly. An
interesting property of using shortest-cost routing is that
packet delays do not increase. Finally, we note that our new
metrics can be used in most traditional routing protocols for
ad hoc networks.},
}
@inproceedings{singh2001immunology,
	author = {Singh, Surya P. N. and Thayer, Scott M.},
	title = {{Immunology Directed Methods for Distributed Robotics: A Novel, Immunity-Based Architecture for Robust Control and Coordination}},
	booktitle = {SPIE: Mobile Robots XVI},
	volume = {4573},
	year = {2001},
	month = {October},
	address = {Newton, MA},
}
@article{sinha1999cedar,
	author = {Sinha, Prasun and Sivakumar, Raghupathy and Bharghavan, Zaduvur},
	title = {{Cedar: a core-extraction distributed ad hoc routing algorithm}},
	journal = {IEEE Journal on Selected Areas in Communications},
	volume = {17},
	keywords = {Ad hoc routing, QoS routing},
	year = {1999},
	abstract = {CEDAR is an algorithm for QoS routing in ad hoc network environments.
It has three key components: (a) the establishment and maintenance
of a self-organizing routing infrastructure called the core for performing
route computations, (b) the propagation of the link-state of stable
high-bandwidth links in the core through increase/decrease waves, and (c) a
QoS route computation algorithm that is executed at the core nodes using
only locally available state.
Our preliminary performance evaluation shows that CEDAR is a robust
and adaptive QoS routing algorithm that reacts effectively to the dynamics
of the network while still approximating link-state performance for stable
networks.},
}
@article{sohrabi2000protocols,
	author = {Sohrabi, Katayoun and Gao, Jay and Ailawadhi, Vishal and Pottie, Gregory J},
	title = {{Protocols for Self-Organization of a Wireless Sensor Network}},
	journal = {IEEE Personal Communications},
	year = {2000},
	abstract = {We present a suite of algorithms for self-organization of wireless sensor networks, in which there is a
scalably large number of mainly static nodes with highly constrained energy resources. The protocols
further support slow mobility by a subset of the nodes, energy-efficient routing, and formation of ad hoc
subnetworks for carrying out cooperative signal processing functions among a set of the nodes.},
}
@article{solis2006in-network,
	author = {Solis, Ignacio and Obraczka, Katia},
	title = {{In-network aggregation trade-offs for data collection in wireless sensor networks}},
	journal = {International Journal of Sensor Networks (IJSNET)},
	pages = {200-212},
	volume = {1},
	number = {3/4},
	year = {2006},
}
@article{su2005time-diffusion,
	author = {Su, Weilian and Akyildiz, Ian F.},
	title = {{Time-Diffusion Synchronization Protocol for Wireless Sensor Networks}},
	journal = {IEEE/ACM Transactions on Networking (TON)},
	pages = {384-397},
	volume = {13},
	number = {2},
	year = {2005},
	month = {April},
}
@techreport{sun2003dynamic,
	author = {Sun, Yuan and Belding-Royer, Elizabeth M.},
	title = {{Dynamic Address Configuration in Mobile Ad hoc Networks}},
	year = {2003},
	month = {March},
	institution = {Department of Computer Science, UCSB},
	number = {2003-11},
	type = {Technical Report},
}
@article{sun2004study,
	author = {Sun, Yuan and Belding-Royer, Elizabeth M.},
	title = {{A study of dynamic addressing techniques in mobile ad hoc networks}},
	journal = {Wireless Communications and Mobile Computing},
	pages = {315-329},
	volume = {4},
	number = {3},
	year = {2004},
	month = {April},
}
@article{szewczyk2004habitat,
	author = {Szewczyk, Robert and Osterweil, Eric and Polastre, Joseph and Hamilton, Michael and Mainwaring, Alan and Estrin, Deborah},
	title = {{Habitat monitoring with sensor networks}},
	journal = {Communications of the ACM, Special Issue on Wireless Sensor Networks},
	pages = {34-40},
	volume = {47},
	number = {6},
	year = {2004},
	month = {June},
}
@inproceedings{talucci1997maca-bi,
	author = {Talucci, Fabrizio and Gerla, Mario},
	title = {{MACA-BI (MACA By Invitation) - A Wireless MAC Protocol for High Speed ad hoc Networking}},
	booktitle = {IEEE International Conference on Universal Personal Communications (ICUPC)},
	pages = {913-917},
	volume = {2},
	year = {1997},
	month = {October},
	address = {San Diego, CA, USA},
}
@article{tanenbaum2006taking,
	author = {Tanenbaum, Andrew S. and Gamage, Chandana and Crispo, Bruno},
	title = {{Taking Sensor Networks from the Lab to the Jungle}},
	journal = {IEEE Computer},
	pages = {98-100},
	volume = {39},
	number = {8},
	year = {2006},
	month = {August},
}
@article{thakoor2004bees,
	author = {Thakoor, Sarita and Chahl, Javaan and Hine, Butler and Zornetzer, Steve},
	title = {{BEES: Exploring Mars with Bioinspired Technologies}},
	journal = {IEEE Computer},
	pages = {38-47},
	volume = {37},
	number = {9},
	year = {2004},
	month = {September},
}
@article{thakoor2002bioinspired,
	author = {Thakoor, Sarita and Chahl, Javaan and Srinivasan, M. V. and Young, L. and Werblin, Frank and Hine, Butler and Zornetzer, Steven},
	title = {{Bioinspired Engineering of Exploration Systems for NASA and DoD}},
	journal = {Artificial Life Journal},
	pages = {357-369},
	volume = {8},
	number = {4},
	year = {2002},
}
@article{theraulaz1999brief,
	author = {Theraulaz, Guy and Bonabeau, Eric},
	title = {{A brief history of stigmergy}},
	journal = {Artificial Life Journal},
	pages = {97-116},
	volume = {5},
	number = {2},
	year = {1999},
}
@article{toh2001maximum,
	author = {Toh, C.-K.},
	title = {{Maximum battery life routing to support ubiquitous mobile computing in wireless ad hoc networks}},
	journal = {IEEE Communications Magazine},
	pages = {138-147},
	volume = {39},
	number = {6},
	keywords = {cells (electric), land mobile radio, mobile computing, packet radio networks, protocols, telecommunication network reliability, telecommunication network routing},
	year = {2001},
	month = {June},
	abstract = {Most ad hoc mobile devices today operate on batteries. Hence, power consumption becomes an important issue. To maximize the lifetime of ad hoc mobile networks, the power consumption rate of each node must be evenly distributed, and the overall transmission power for each connection request must be minimized. These two objectives cannot be satisfied simultaneously by employing routing algorithms proposed in previous work. We present a new power-aware routing protocol to satisfy these two constraints simultaneously; we also compare the performance of different types of power-related routing algorithms via simulation. Simulation results confirm the need to strike a balance in attaining service availability performance of the whole network vs. the lifetime of ad hoc mobile devices},
}
@inproceedings{toner2003self-organizing,
	author = {Toner, Stephen and O'Mahony, Donal},
	title = {{Self-Organising Node Address Management in Ad Hoc Networks}},
	booktitle = {8th IFIP International Conference on Personal Wireless Communications (PWC 2003)},
	pages = {476-483},
	volume = {LNCS 2775},
	year = {2003},
	month = {September},
	address = {Venice, Italy},
	publisher = {Springer},
}
@inproceedings{trianni2004evolution,
	author = {Trianni, Vito and Labella, Thomas Halva and Dorigo, Marco},
	title = {{Evolution of Direct Communication for a Swarm-bot Performing Hole Avoidance}},
	booktitle = {Ant Colony Optimization and Swarm Intelligence (ANTS2004)},
	year = {2004},
	month = {September},
	address = {Brussels, Belgium},
	abstract = {Communication is often required for coordination of collective
behaviours. Social insects like ants, termites or bees make use of different
forms of communication, which can be roughly classified in three
classes: indirect (stigmergic) communication, direct interaction and direct
communication. The use of stigmergic communication is predominant
in social insects (e.g., the pheromone trails in ants), but also direct
interactions (e.g., antennation in ants) and direct communication can be
observed (e.g., the waggle dance of honey bee workers). Direct communication
may be beneficial when a fast reaction is expected, as for instance,
when a danger is detected and countermeasures must be taken. This is
the case of hole avoidance, the task studied in this paper: a group of selfassembled
robots – called swarm-bot – coordinately explores an arena
containing holes, avoiding to fall into them. In particular, we study the
use of direct communication in order to achieve a reaction to the detection
of a hole faster than with the sole use of direct interactions through
physical links. We rely on artificial evolution for the synthesis of neural
network controllers, showing that evolving behaviours that make use of
direct communication.},
}
@article{turing1952chemical,
	author = {Turing, A. M.},
	title = {{The Chemical Basis for Morphogenesis}},
	journal = {Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences},
	pages = {37-72},
	volume = {237},
	number = {641},
	year = {1952},
	month = {August},
}
@inproceedings{vaidya2002weak,
	author = {Vaidya, Nitin H.},
	title = {{Weak Duplicate Address Detection in Mobile Ad Hoc Networks}},
	booktitle = {3rd ACM international Symposium on Mobile Ad Hoc Networking and Computing (ACM Mobihoc 2002)},
	pages = {206-216},
	year = {2002},
	address = {Lausanne, Switzerland},
}
@techreport{vaidyanathan2004data,
	author = {Vaidyanathan, Karthikeyan and Sur, Sayantan and Narravula, Sundeep and Sinha, Prasun},
	title = {{Data Aggregation Techniques in Sensor Networks}},
	year = {2004},
	institution = {Ohio State University},
	number = {OSU-CISRC-11/04-TR60},
	type = {Technical Report},
}
@inproceedings{wang2004movement-assisted,
	author = {Wang, Guiling and Cao, Guohong and Porta, Tom La},
	title = {{Movement-Assisted Sensor Deployment}},
	booktitle = {23rd IEEE Conference on Computer Communications (IEEE INFOCOM 2004)},
	year = {2004},
	month = {March},
	address = {Hong Kong},
}
@article{wang2006survey,
	author = {Wang, Lan and Xiao, Yang},
	title = {{A survey of energy-efficient scheduling mechanisms in sensor networks}},
	journal = {Mobile Networks and Applications},
	pages = {723-740},
	volume = {11},
	number = {5},
	keywords = {energy consumption, energy-efficient scheduling, scheduling, sensor network, sleep-mode},
	year = {2006},
	month = {October},
	abstract = {Sensor networks have a wide range of potential, practical and useful applications. However, there are issues that need to be addressed for efficient operation of sensor network systems in real applications. Energy saving is one critical issue for sensor networks since most sensors are equipped with nonrechargeable batteries that have limited lifetime. To extend the lifetime of a sensor network, one common approach is to dynamically schedule sensors' work/ sleep cycles (or duty cycles). Moreover, in cluster-based networks, cluster heads are usually selected in a way that minimizes the total energy consumption and they may rotate among the sensors to balance energy consumption. In general, these energy-efficient scheduling mechanisms (also called topology configuration mechanisms) need to satisfy certain application requirements while saving energy. In this paper, we provide a survey on energy-efficient scheduling mechanisms in sensor networks that have different design requirements than those in traditional wireless networks. We classify these mechanisms based on their design assumptions and design objectives. Different mechanisms may make different assumptions about their sensors including detection model, sensing area, transmission range, failure model, time synchronization, and the ability to obtain location and distance information. They may also have different assumptions about network structure and sensor deployment strategy. Furthermore, while all the mechanisms have a common design objective to maximize network lifetime, they may also have different objectives determined by their target applications.},
}
@inproceedings{wang2001bionetworking,
	author = {Wang, M. and Suda, Tatsuya},
	title = {{The Bio-Networking Architecture: A Biologically Inspired Approach to the Design of Scalable, Adaptive, and Survivable/Available Network Applications}},
	booktitle = {1st IEEE Symposium on Applications and the Internet (SAINT)},
	year = {2001},
	month = {January},
	address = {San Diego, CA, USA},
}
@inproceedings{wang2005using,
	author = {Wang, Wei and Srinivasan, Vikram and Chua, Kee-Chaing},
	title = {{Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks}},
	booktitle = {11th ACM International Conference on Mobile Computing and Networking (ACM MobiCom 2005)},
	pages = {270-283},
	keywords = {Sensor networks, Network lifetime, Mobile relay},
	year = {2005},
	month = {August/September},
	address = {Cologne, Germany},
	abstract = {In this paper we investigate the benefits of a heterogeneous
architecture for wireless sensor networks composed of a few
resource rich mobile nodes and a large number of simple
static nodes. These mobile nodes can either act as mobile
relays or mobile sinks. To investigate the performance of
these two options and the trade-offs associated with these
two options, we first consider a finite network. We then compute
the lifetime for different routing algorithms for three
cases (i) when the network is all static (ii) when there is one
mobile sink and (iii) when there is one mobile relay. We
find that using the mobile node as a sink results in the maximum
improvement in lifetime. We contend however that
in hostile terrains, it might not always be possible for the
sink to be mobile. We then investigate the performance of
a large dense network with one mobile relay and show that
the improvement in network lifetime over an all static network
is upper bounded by a factor of four. Also, the proof
implies that the mobile relay needs to stay only within a
two hop radius of the sink. We then construct a joint mobility
and routing algorithm which comes close to the upper
bound. However this algorithm requires all the nodes in
the network to be aware of the location of the mobile node.
We then proposed an alternative algorithm, which achieves
the same performance, but requires only a limited number
of nodes in the network to be aware of the location of the
mobile. We finally compare the performance of the mobile
relay and mobile sink and show that for a densely deployed
sensor field of radius R hops, we require O(R) mobile relays
to achieve the same performance as the mobile sink.},
}
@article{warneke2001smart,
	author = {Warneke, Brett and Last, Matt and Liebowitz, Brian and Pister, Kristopher},
	title = {{Smart Dust: Communicationg with a Cubic-Millimeter Computer}},
	journal = {Computer},
	pages = {44-51},
	volume = {34},
	number = {1},
	year = {2001},
	month = {January},
}
@inproceedings{warneke2002autonomous,
	author = {Warneke, Brett A. and Scott, Michael D. and Leibowitz, Brian S. and Zhou, Lixia and Bellew, Colby L. and Chediak, J. Alex and Kahn, Joseph M. and Boser, Bernhard E. and Pister, Kristofer S.J.},
	title = {{An Autonomous 16mm3 Solar-Powered Node for Distributed Wireless Sensor Networks}},
	booktitle = {IEEE International Conference on Sensors 2002},
	year = {2002},
	month = {June},
	address = {Orlando, FL},
}
@article{weiser1991computer,
	author = {Weiser, Mark},
	title = {{The Computer for the 21st Century}},
	journal = {Scientific American},
	pages = {94-104},
	volume = {265},
	number = {3},
	year = {1991},
	month = {September},
}
@article{weiser1993ubiquitous,
	author = {Weiser, Mark},
	title = {{Ubiquitous Computing}},
	journal = {IEEE Computer},
	pages = {71-72},
	volume = {26},
	number = {10},
	year = {1993},
	month = {October},
	abstract = {The author suggests that, due to the trends of unobtrusive technology and more intrusive information, the next phase of computing technology will develop nonlinearly. He states that, in the long run, the personal computer and the workstation will become practically obsolete because computing access will be everywhere: in the walls, on your wrist, and in 'scrap' computers (i.e., like scrap paper) lying about to be used as needed. The current research on ubiquitous computing is reviewed.},
}
@article{weiser1993some,
	author = {Weiser, Mark},
	title = {{Some computer science issues in ubiquitous computing}},
	journal = {Communications of the ACM},
	pages = {75-84},
	volume = {36},
	number = {7},
	year = {1993},
	month = {July},
}
@article{weng1999complexity,
	author = {Weng, Gezhi and Bhalla, Upinder S. and Iyengar, Ravi},
	title = {{Complexity in Biological Signaling Systems}},
	journal = {Science},
	pages = {92-96},
	volume = {284},
	number = {5411},
	year = {1999},
	month = {April},
}
@inproceedings{weniger2003passive,
	author = {Weniger, Kilian},
	title = {{Passive Duplicate Address Detection in Mobile Ad hoc Networks}},
	booktitle = {IEEE Wireless Communications and Networking Conference (WCNC 2003)},
	year = {2003},
	month = {March},
	address = {New Orleans, USA},
}
@article{weniger2005pacman,
	author = {Weniger, Kilian},
	title = {{PACMAN: Passive Autoconfiguration for Mobile Ad hoc Networks}},
	journal = {IEEE Journal on Selected Areas in Communications (JSAC)},
	pages = {507-519},
	volume = {23},
	number = {3},
	year = {2005},
	month = {March},
}
@inproceedings{weniger2002ipv6,
	author = {Weniger, Kilian and Zitterbart, Martina},
	title = {{IPv6 Autoconfiguration in Large Scale Mobile Ad-Hoc Networks}},
	booktitle = {European Wireless 2002},
	pages = {142-148},
	year = {2002},
	month = {February},
	address = {Florence, Italy},
}
@article{weniger2004address,
	author = {Weniger, Kilian and Zitterbart, Martina},
	title = {{Address Autoconfiguration in Mobile Ad Hoc Networks: Current Approaches and Future Directions}},
	journal = {IEEE Network Magazine, Special issue on Ad hoc networking: data communications and topology control},
	pages = {6-11},
	volume = {18},
	number = {4},
	year = {2004},
	month = {July},
}
@article{werner1999complexity,
	author = {Werner, B. T.},
	title = {{Complexity in Natural Landform Patterns}},
	journal = {Science},
	pages = {102-104},
	volume = {284},
	number = {5411},
	year = {1999},
	month = {April},
}
@article{whitesides1999complexity,
	author = {Whitesides, George M. and Ismagilov, Rustem F.},
	title = {{Complexity in Chemistry}},
	journal = {Science},
	pages = {89-92},
	volume = {284},
	number = {5411},
	year = {1999},
	month = {April},
}
@inproceedings{williams2002comparison,
	author = {Williams, Brad and Camp, Tracy},
	title = {{Comparison of Broadcasting Techniques for Mobile Ad Hoc Networks}},
	booktitle = {3rd ACM international Symposium on Mobile Ad Hoc Networking and Computing (ACM Mobihoc 2002)},
	pages = {194-205},
	year = {2002},
	address = {Lausanne, Switzerland},
}
@article{winfree1972spiral,
	author = {Winfree, Arthur T.},
	title = {{Spiral Waves of Chemical Activity}},
	journal = {Science},
	pages = {634-636},
	volume = {175},
	number = {4022},
	year = {1972},
	month = {February},
}
@article{wischhof2005information,
	author = {Wischhof, Lars and Ebner, Andr\'{e} and Rohling, Hermann},
	title = {{Information dissemination in self-organizing intervehicle networks}},
	journal = {IEEE Transactions on Intelligent Transportation Systems},
	pages = {90-101},
	volume = {6},
	number = {1},
	year = {2005},
	month = {March},
}
@inproceedings{wischhof2003sotis,
	author = {Wischhof, Lars and Ebner, Andr\'{e} and Rohling, Hermann and Lott, Matthias and Halfmann, R\"{u}diger},
	title = {{SOTIS - A Self-Organizing Traffic Information System}},
	booktitle = {57th IEEE Vehicular Technology Conference (VTC2003-Spring)},
	year = {2003},
	month = {April},
	address = {Jeju, South Korea},
}
@inproceedings{wu2005smart,
	author = {Wu, Jie and Yan, Shuhui},
	title = {{SMART: A Scan-Based Movement-Assisted Sensor Deployment Method in Wireless Sensor Networks}},
	booktitle = {24th IEEE Conference on Computer Communications (IEEE INFOCOM 2005)},
	year = {2005},
	month = {March},
	address = {Miami, FL, USA},
}
@article{xing2005integrated,
	author = {Xing, Guoliang and Wang, Xiaorui and Zhang, Yuanfang and Lu, Chenyang and Pless, Robert and Gill, Christopher},
	title = {{Integrated Coverage and Connectivity Configuration for Energy Conservation in Sensor Networks}},
	journal = {ACM Transactions on Sensor Networks (TOSN)},
	pages = {36-72},
	volume = {1},
	number = {1},
	year = {2005},
	month = {August},
	abstract = {An effective approach for energy conservation in wireless sensor networks is scheduling sleep intervals for extraneous nodes while the remaining nodes stay active to provide continuous service. For the sensor network to operate successfully, the active nodes must maintain both sensing coverage and network connectivity. Furthermore, the network must be able to configure itself to any feasible degree of coverage and connectivity in order to support different applications and environments with diverse requirements. This article presents the design and analysis of novel protocols that can dynamically configure a network to achieve guaranteed degrees of coverage and connectivity. This work differs from existing connectivity or coverage maintenance protocols in several key ways. (1) We present a Coverage Configuration Protocol (CCP) that can provide different degrees of coverage requested by applications. This flexibility allows the network to self-configure for a wide range of applications and (possibly dynamic) environments. (2) We provide a geometric analysis of the relationship between coverage and connectivity. This analysis yields key insights for treating coverage and connectivity within a unified framework; in sharp contrast to several existing approaches that address the two problems in isolation. (3) We integrate CCP with SPAN to provide both coverage and connectivity guarantees. (4) We propose a probabilistic coverage model and extend CCP to provide probabilistic coverage guarantees. We demonstrate the capability of our protocols to provide guaranteed coverage and connectivity configurations through both geometric analysis and extensive simulations.},
}
@inproceedings{xu2001geography-informed,
	author = {Xu, Ya and Heidemann, John and Estrin, Deborah},
	title = {{Geography-informed energy conservation for ad hoc routing}},
	booktitle = {7th ACM International Conference on Mobile Computing and Networking (ACM MobiCom 2001)},
	year = {2001},
	month = {July},
	address = {Rome, Italy},
	abstract = {We introduce a geographical adaptive fidelity (GAF) algorithm that reduces energy consumption in ad hoc wireless networks. GAF conserves energy by identifying nodes that are equivalent from a routing perspective and turning off unnecessary nodes, keeping a constant level of routing fidelity. GAF moderates this policy using application- and system-level information; nodes that source or sink data remain on and intermediate nodes monitor and balance energy use. GAF is independent of the underlying ad hoc routing protocol; we simulate GAF over unmodified AODV and DSR. Analysis and simulation studies of GAF show that it can consume 40% to 60% less energy than an unmodified ad hoc routing protocol. Moreover, simulations of GAF suggest that network lifetime increases proportionally to node density; in one example, a four-fold increase in node density leads to network lifetime increase for 3 to 6 times (depending on the mobility pattern). More generally, GAF is an example of adaptive fidelity, a technique proposed for extending the lifetime of self-configuring systems by exploiting redundancy to conserve energy while maintaining application fidelity.},
}
@article{yao2002cougar,
	author = {Yao, Yong and Gehrke, Johannes},
	title = {{The Cougar Approach to In-Network Query Processing in Sensor Networks}},
	journal = {ACM SIGMOD Record},
	pages = {9-18},
	volume = {31},
	number = {3},
	year = {2002},
	abstract = {The widespread distribution and availability of small-scale sensors, actuators, and embedded processors is transforming the physical world into a computing platform. One such example is a sensor network consisting of a large number of sensor nodes that combine physical sensing capabilities such as temperature, light, or seismic sensors with networking and computation capabilities. Applications range from environmental control, warehouse inventory, and health care to military environments. Existing sensor networks assume that the sensors are preprogrammed and send data to a central frontend where the data is aggregated and stored for offline querying and analysis. This approach has two major drawbacks. First, the user cannot change the behavior of the system on the fly. Second, conservation of battery power is a major design factor, but a central system cannot make use of in-network programming, which trades costly communication for cheap local computation.In this paper, we introduce the Cougar approach to tasking sensor networks through declarative queries. Given a user query, a query optimizer generates an efficient query plan for in-network query processing, which can vastly reduce resource usage and thus extend the lifetime of a sensor network. In addition, since queries are asked in a declarative language, the user is shielded from the physical characteristics of the network. We give a short overview of sensor networks, propose a natural architecture for a data management system for sensor networks, and describe open research problems in this area.},
}
@techreport{ye2003medium,
	author = {Ye, Wei and Heidemann, John},
	title = {{Medium Access Control in Wireless Sensor Networks}},
	year = {2003},
	month = {October},
	institution = {USC/Information Sciences Institute},
	number = {ISI-TR-580},
	type = {Technical Report},
}
@inproceedings{ye2002energy-efficient,
	author = {Ye, Wei and Heidemann, John and Estrin, Deborah},
	title = {{An Energy-Efficient MAC Protocol for Wireless Sensor Networks}},
	booktitle = {21st IEEE Conference on Computer Communications (IEEE INFOCOM 2002)},
	pages = {1567-1576},
	volume = {3},
	year = {2002},
	month = {June},
	address = {New York, NY, USA},
}
@article{ye2004medium,
	author = {Ye, Wei and Heidemann, John and Estrin, Deborah},
	title = {{Medium Access Control with Coordinated Adaptive Sleeping for Wireless Sensor Networks}},
	journal = {IEEE/ACM Transactions on Networking (TON)},
	pages = {493-506},
	volume = {12},
	number = {3},
	year = {2004},
	month = {June},
}
@inproceedings{younis2003optimization,
	author = {Younis, Mohamed and Akkaya, Kemal and Kunjithapatham, Anugeetha},
	title = {{Optimization of Task Allocation in a Cluster-Based Sensor Network}},
	booktitle = {8th IEEE International Symposium on Computers and Communications},
	pages = {329-340},
	year = {2003},
	month = {June},
	address = {Kemer-Antalya, Turkey},
}
@article{younis2004heed,
	author = {Younis, Ossama and Fahmy, Sonia},
	title = {{HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad-hoc Sensor Networks}},
	journal = {IEEE Transactions on Mobile Computing},
	pages = {366-379},
	volume = {3},
	number = {4},
	year = {2004},
	month = {October-December},
	abstract = {Topology control in a sensor network balances load on sensor nodes, and increases network scalability and
lifetime. Clustering sensor nodes is an effective topology control approach. In this paper, we propose a novel
distributed clustering approach for long-lived ad-hoc sensor networks. Our proposed approach does not make any
assumptions about the presence of infrastructure or about node capabilities, other than the availability of multiple
power levels in sensor nodes. We present a protocol, HEED (Hybrid Energy-Efficient Distributed clustering), that
periodically selects cluster heads according to a hybrid of the node residual energy and a secondary parameter,
such as node proximity to its neighbors or node degree. HEED terminates in O(1) iterations, incurs low message
overhead, and achieves fairly uniform cluster head distribution across the network. We prove that, with appropriate
bounds on node density and intra-cluster and inter-cluster transmission ranges, HEED can asymptotically almost
surely guarantee connectivity of clustered networks. Simulation results demonstrate that our proposed approach is
effective in prolonging the network lifetime and supporting scalable data aggregation.},
}
@techreport{yu2001geographical,
	author = {Yu, Yan and Govindan, Ramesh and Estrin, Deborah},
	title = {{Geographical and Energy Aware Routing: a recursive data dissemination protocol for wireless sensor networks}},
	year = {2001},
	institution = {UCLA Computer Science Department},
	number = {UCLA/CSD-TR-01-0023},
	abstract = {Future sensor networks will be composed of a large number
of densely deployed sensors/actuators. A key feature of
such networks is that their nodes are untethered and unattended.
Consequently, energy efficiency is an important design
consideration for these networks. Motivated by the fact
that sensor network queries may often be geographical, we
design and evaluate an energy efficient routing algorithm
that propagates a query to the appropriate geographical region,
without flooding. The proposed Geographic and Energy
Aware Routing (GEAR) algorithm uses energy aware
neighbor selection to route a packet towards the target region
and Recursive Geographic Forwarding or Restricted Flooding
algorithm to disseminate the packet inside the destination
region.
We evaluate the GEAR protocol using simulation. We find
that, especially for non-uniform traffic distribution, GEAR
exhibits noticeably longer network lifetime than non-energyaware
geographic routing algorithms.},
	type = {Technical Report},
}
@inproceedings{zambonelli2004spray,
	author = {Zambonelli, Franco and Gleizes, Marie-Pierre and Mamei, Marco and Tolksdorf, Robert},
	title = {{Spray Computers: Frontiers of Self-Organization for Pervasive Computing}},
	booktitle = {13th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE'04)},
	pages = {403-408},
	year = {2004},
}
@article{zhang2005dynamic,
	author = {Zhang, Qi and Agrawal, Dharma P.},
	title = {{Dynamic probabilistic broadcasting in MANETs}},
	journal = {Journal of Parallel and Distributed Computing},
	pages = {220-233},
	volume = {65},
	number = {2},
	year = {2005},
	month = {February},
	abstract = {In mobile ad hoc networks (MANETs), the efficiency of broadcasting protocol can dramatically affect the performance of the entire network. Appropriate use of a probabilistic method can reduce the number of rebroadcasting, therefore reduce the chance of contention and collision among neighboring nodes. A good probabilistic broadcast protocol can achieve higher throughput and lower energy consumption, without sacrificing the reachability or having any significant degradation. In this paper, we propose a probabilistic approach that dynamically adjusts the rebroadcasting probability as per the node distribution and node movement. This is done based on locally available information and without requiring any assistance of distance measurements or exact location determination devices. We evaluate the performance of our approach by comparing it with the AODV protocol (which is based on simple flooding) as well as a fixed probabilistic approach. Simulation results show our approach performs better than both simple flooding and fixed probabilistic schemes.},
}
@inproceedings{zhou2004group,
	author = {Zhou, Biao and Xu, Kaixin and Gerla, Mario},
	title = {{Group and Swarm Mobility Models for Ad Hoc Network Scenarios Using Virtual Tracks}},
	booktitle = {MILCOM 2004},
	year = {2004},
	address = {Monterey, California, USA},
	abstract = {The mobility model is one of the most important factors in
the performance evaluation of a mobile ad hoc network
(MANET). Traditionally, the random waypoint mobility
model has been used to model the node mobility, where
the movement of one node is modeled as independent from
all others. However, in reality, especially in large scale
military scenarios, mobility coherence among nodes is
quite common. One typical mobility behavior is group
mobility. Thus, to investigate military MANET scenarios,
an underlying realistic mobility model is highly desired. In
this paper, we propose a “virtual track” based group mobility
model (VT model) which closely approximates the mobility
patterns in military MANET scenarios. It models
various types of node mobility such as group moving
nodes, individually moving nodes as well as static nodes.
Moreover, the VT model not only models the group mobility,
it also models the dynamics of group mobility such as
group merge and split. Simulation experiments show that
the choice of mobility model has significant impact on
network performance.},
}
@inproceedings{zhou2005fault,
	author = {Zhou, Zongheng and Das, Samir R. and Gupta, Himanshu},
	title = {{Fault Tolerant Connected Sensor Cover with Variable Sensing and Transmission Ranges}},
	booktitle = {Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks (IEEE SECON 2005)},
	pages = {594-604},
	year = {2005},
	month = {September},
	abstract = {Sensor networks are often deployed in a redundant
fashion. In order to prolong the network lifetime, it is desired
to choose only a subset of sensors to keep active and put the
rest to sleep. In order to provide fault tolerance, this small
subset of active sensors should also provide some degree of
redundancy. In this paper, we consider the problem of choosing
a minimum subset of sensors such that they maintain a required
degree of coverage and also form a connected network with
a required degree of fault tolerance. In addition, we consider
a more general, variable radii sensor model, wherein every
sensor can adjust both its sensing and transmission ranges to
minimize overall energy consumption in the network. We call this
the variable radii k1-Connected, k2-Cover problem. To address
this problem, we propose a distributed and localized Voronoibased
algorithm. The approach extends the relative neighborhood
graph (RNG) structure to preserve k-connectivity in a graph, and
design a distributed technique to inactivate desirable nodes while
preserving k-connectivity of the remaining active nodes. We show
through extensive simulations that our proposed techniques result
in overall energy savings in random sensor networks over a wide
range of experimental parameters.},
}
@article{zimmer1999complex,
	author = {Zimmer, Carl},
	title = {{Complex Systems: Life after Chaos}},
	journal = {Science},
	pages = {83-86},
	volume = {284},
	number = {5411},
	year = {1999},
	month = {April},
}
@inproceedings{zou2003sensor,
	author = {Zou, Yi and Chakrabarty, Krishnendu},
	title = {{Sensor Deployment and Target Localization Based on Virtual Forces}},
	booktitle = {22nd IEEE Conference on Computer Communications (IEEE INFOCOM 2003)},
	pages = {1293-1303},
	year = {2003},
	month = {March},
	address = {San Franciso, CA, USA},
}
@book{abraham2006stigmergic,
	author = {Abraham, Ajith and Grosan, Crina and Ramos, Vitorino},
	title = {{Stigmergic Optimization}},
	series = {Studies in Computational Intelligence},
	pages = {299},
	volume = {31},
	year = {2006},
	location = {Berlin},
	publisher = {Springer},
}
@book{alberts1994molecular,
	author = {Alberts, Bruce and Bray, Dennis and Lewis, Julian and Raff, Martin and Roberts, Keith and Watson, James D.},
	title = {{Molecular Biology of the Cell}},
	edition = {3rd},
	year = {1994},
	publisher = {Garland Publishing, Inc.},
}
@incollection{ashby1962principles,
	author = {Ashby, W. R.},
	editor = {von Foerster, Heinz and Zopf, George W.},
	title = {{Principles of the Self-Organizing System}},
	booktitle = {Principles of Self-Organization},
	pages = {255-278},
	year = {1962},
	publisher = {Pergamon Press},
}
@book{asimov1968i,
	author = {Asimov, Isaak},
	title = {{I, Robot}},
	year = {1968},
	location = {London},
	publisher = {Gordon Books},
}
@book{bezdek1981pattern,
	author = {Bezdek, James C.},
	title = {{Pattern Recognition with Fuzzy Objective Function Algorithms}},
	year = {1981},
	location = {Norwell, MA},
	publisher = {Kluwer Academic Publishers},
}
@book{bishop1996neural,
	author = {Bishop, Christopher M.},
	title = {{Neural Networks for Pattern Recognition}},
	year = {1996},
	publisher = {Oxford University Press},
}
@book{bonabeau1999swarm,
	author = {Bonabeau, Eric and Dorigo, Marco and Theraulaz, Guy},
	title = {{Swarm Intelligence: From Natural to Artificial Systems}},
	year = {1999},
	location = {New York},
	publisher = {Oxford University Press},
	isbn = {0-19-513158-4},
}
@book{brooks1997multi-sensor,
	author = {Brooks, R. R. and Iyengar, S. S.},
	title = {{Multi-Sensor Fusion: Fundamentals and Applications With Software}},
	year = {1997},
	publisher = {Prentice Hall PTR},
}
@book{camazine2003self-organization,
	author = {Camazine, Scott and Deneubourg, Jean-Louis and Franks, Nigel R. and Sneyd, James and Theraula, Guy and Bonabeau, Eric},
	title = {{Self-Organization in Biological Systems}},
	year = {2003},
	location = {Princeton},
	publisher = {Princeton University Press},
	isbn = {0-691-11624-5},
}
@book{chandor1985penguin,
	author = {Chandor, Anthony},
	title = {{The Penguin Dictionary of Computers}},
	edition = {3rd},
	year = {1985},
	location = {London},
	publisher = {Penguin},
}
@book{decastro2006fundamentals,
	author = {de Castro, Leandro Nunes},
	title = {{Fundamentals of Natural Computing: Basic Concepts, Algorithms, and Applications}},
	year = {2006},
	location = {Boca Raton},
	publisher = {Chapman \& Hall/CRC},
}
@book{decastro2002artificial,
	author = {de Castro, Leandro Nunes and Timmis, Jonathan},
	title = {{Artificial Immune Systems: A New Computational Intelligence Approach}},
	year = {2002},
	location = {Berlin},
	publisher = {Springer},
}
@book{eigen1979hypercycle,
	author = {Eigen, Manfred and Schuster, Peter},
	title = {{The Hypercycle: A Principle of Natural Self Organization}},
	year = {1979},
	location = {Berlin},
	publisher = {Springer},
	isbn = {3-540-09293-5},
}
@book{foster2004grid2,
	author = {Foster, Ian and Kesselman, Carl},
	title = {{The Grid 2: Blueprint for a New Computing Infrastructure}},
	edition = {2nd},
	year = {2004},
	publisher = {Morgan Kaufmann},
}
@book{freshney2002culture,
	author = {Freshney, R. Ian and Freshney, Mary G.},
	title = {{Culture of Epithelial Cells}},
	edition = {2nd},
	year = {2002},
	publisher = {Wiley},
}
@book{gale1960theory,
	author = {Gale, D.},
	title = {{The Theory of Linear Economic Models}},
	year = {1960},
	location = {New York},
	publisher = {McGraw-Hill Book Company},
}
@incollection{ganeriwal2005time,
	author = {Ganeriwal, Saurabh and Elson, Jeremy and Srivastava, Mani B.},
	editor = {Bulusu, Nirupama and Jha, Sanjay},
	title = {{Time Synchronization}},
	booktitle = {Wireless Sensor Networks},
	pages = {59-74},
	year = {2005},
	address = {Boston, London},
	publisher = {Artech House},
}
@book{goldberg1989genetic,
	author = {Goldberg, David E.},
	title = {{Genetic Algorithms in Search, Optimization and Machine Learning}},
	year = {1989},
	location = {Boston},
	publisher = {Kluwer Academic Publishers},
}
@book{grimmett1989percolation,
	author = {Grimmett, Geoffrey},
	title = {{Percolation}},
	year = {1989},
	publisher = {Springer},
}
@book{hansmann2003pervasive,
	author = {Hansmann, U. and Merk, L. and Nicklous, M. S. and Stober, T.},
	title = {{Pervasive Computing - The Mobile World}},
	series = {Springer Professional Computing},
	edition = {2nd},
	year = {2003},
	location = {Berlin},
	publisher = {Springer},
}
@book{hartigan1975clustering,
	author = {Hartigan, J. A.},
	title = {{Clustering Algorithms}},
	year = {1975},
	location = {New York, NY},
	publisher = {John Wiley and Sons, Inc.},
}
@book{jain1991art,
	author = {Jain, Raj},
	title = {{The Art of Computer Systems Performance Analysis: Techniques for Experimental Design, Measurement, Simulation, and Modeling}},
	year = {1991},
	location = {New York},
	publisher = {John Wiley and Sons, Inc.},
}
@book{janeway2001immunobiology,
	author = {Janeway, Charles A. and Walport, Mark and Travers, Paul},
	title = {{Immunobiology: The Immune System in Health and Disease}},
	edition = {5th},
	year = {2001},
	publisher = {Garland Publishing},
}
@book{karl2005protocols,
	author = {Karl, Holger and Willig, Andreas},
	title = {{Protocols and Architectures for Wireless Sensor Networks}},
	year = {2005},
	publisher = {Wiley},
}
@book{kauffman1993origins,
	author = {Kauffman, Stuart A.},
	title = {{The Origins of Order: Self-Organization and Selection in Evolution}},
	year = {1993},
	publisher = {Oxford University Press},
}
@book{keith2000core,
	author = {Keith, E. W.},
	title = {{Core Jini}},
	edition = {2nd},
	year = {2000},
	location = {Upper Saddle River, NJ},
	publisher = {Prentice Hall},
}
@book{kennedy2001swarm,
	author = {Kennedy, James and Eberhart, Russell C.},
	title = {{Swarm Intelligence}},
	year = {2001},
	location = {San Francisco},
	publisher = {Morgan Kaufmann Publishers},
	isbn = {1-55860-595-9},
}
@book{law2000simulation,
	author = {Law, Averill M. and Kelton, W. David},
	title = {{Simulation, Modeling and Analysis}},
	edition = {3rd},
	year = {2000},
	location = {Singapore},
	publisher = {McGraw-Hill Book Co},
}
@book{murthy2004adhoc,
	author = {Murthy, C. Siva Ram and Manoj, B. S.},
	title = {{Ad Hoc Wireless Networks}},
	year = {2004},
	location = {Upper Saddle River, NJ},
	publisher = {Prentice Hall PTR},
	isbn = {0-13-147023-X},
}
@incollection{neuman1994scale,
	author = {Neuman, B. Clifford},
	editor = {Casavant, T. L. and Singhal, M.},
	title = {{Scale in Distributed Systems}},
	booktitle = {Readings in Distributed Computing Systems},
	pages = {463-489},
	year = {1994},
	address = {Los Alamitos, CA},
	publisher = {IEEE Computer Society Press},
}
@book{neumann1966theory,
	author = {von Neumann, John},
	title = {{Theory of Self-Reproducing Automata}},
	year = {1966},
	location = {Urbana},
	publisher = {University of Illionois Press},
}
@incollection{oritz2003dynamic,
	author = {Ortiz, Charles L. and Rauenbusch, Timothy L. and Hsu, Eric and Vincent, Regis},
	editor = {Lesser, Victor and Ortiz, Charles L. and Tambe, Milind},
	title = {{Dynamic Resource-bounded Negotiation in Non-additive Domains}},
	booktitle = {Distributed Sensor Networks: A Multiagent Perspective},
	series = {Multiagent Systems, Artificial Societies, and Simulated Organizations},
	pages = {61-107},
	year = {2003},
	address = {Boston},
	publisher = {Kluwer Acedemic Pubishers},
	isbn = {1-4020-7499-9},
}
@book{perkins2000adhoc,
	author = {Perkins, Charles E.},
	title = {{Ad Hoc Networking}},
	edition = {1st},
	year = {2000},
	publisher = {Addison-Wesley Professional},
}
@book{resnick1997turtles,
	author = {Resnick, Mitchel},
	title = {{Turtles, Termites, and Traffic Jams - Explorations in Massively Parallel Microworlds}},
	year = {1997},
	publisher = {MIT Press},
}
@book{roundy2003energy,
	author = {Roundy, Shad and Wright, Paul Kenneth and Rabaey, Jan M.},
	title = {{Energy Scavenging for Wireless Sensor Networks}},
	pages = {236},
	year = {2003},
	location = {New York, LLC},
	publisher = {Springer-Verlag},
	isbn = {1-4020-7663-0},
	abstract = {The vast reduction in size and power consumption of CMOS circuitry has led to a large research effort based around the vision of ubiquitous networks of wireless communication nodes. The wireless devices are usually designed to run on batteries. However, as the networks increase in number and the devices decrease in size, the replacement of depleted batteries is not practical. Furthermore, a battery that is large enough to last the lifetime of the device would dominate the overall system size, and thus is not very attractive. There is clearly a need to explore alternative methods of powering these small communication nodes. This book, therefore, focuses on potential "ambient" sources of power that can be scavenged or harvested and subsequently used to run low power electronics and wireless transceivers. 
A wide range of potential power sources are briefly explored. Based on a comparison of these many potential sources, commonly occurring vibrations was chosen as an attractive, and little explored, power source. Models for different types of power converters using both electrostatic and piezoelectric conversion mechanisms have been developed. The models have been validated by testing prototypes driven at vibrations similar to those found in many industrial and commercial building environments. Finally, integration of a piezoelectric generator, power circuit, and custom design radio transceiver is demonstrated. 
Power sources are becoming a bottleneck to the widespread deployment of wireless sensor networks. This work reviews many potential alternative sources of ambient power that can be scavenged. Vibration to electricity converters are explored in great detail, and based on studies and experiments, are shown to be an attractive power source in many applications. 
Energy Scavenging for Wireless Sensor Networks with Special Focus on Vibrations will be of interest to researchers and professionals in the areas of wireless electronics, smart structures and MEMS as well as power electronics.},
}
@book{steinmetz2005peer-to-peer,
	author = {Steinmetz, Ralf and Wehrle, Klaus},
	title = {{Peer-to-Peer Systems and Applications}},
	volume = {LNCS 3485},
	year = {2005},
	publisher = {Springer},
}
@book{tanenbaum2002distributed,
	author = {Tannenbaum, Andrew S. and van Steen, Maarten},
	title = {{Distributed Systems: Principles and Paradigms}},
	year = {2002},
	location = {Upper Saddle River, NJ},
	publisher = {Prentice-Hall, Inc.},
	isbn = {0-13-088893-1},
}
@incollection{vonfoerster1960self-organizing,
	author = {von Foerster, Heinz},
	editor = {Yovitts, M. C. and Cameron, S.},
	title = {{On Self-Organizing Systems and their Environments}},
	booktitle = {Self-Organizing Systems},
	pages = {31-50},
	year = {1960},
	publisher = {Pergamon Press},
}
@book{vonfoerster1962principles,
	author = {von Foerster, Heinz and Zopf, George W.},
	title = {{Principles of Self-Organization}},
	year = {1962},
	location = {New York},
	publisher = {Pergamon Press},
}
@book{waldo2000jini,
	author = {Waldo, J.},
	title = {{The Jini Specification}},
	edition = {2nd},
	year = {2000},
	location = {Upper Saddle River, NJ},
	publisher = {Prentice Hall},
}
@book{wisniewski2004wireless,
	author = {Wisniewski, Steve},
	title = {{Wireless and Cellular Networks}},
	year = {2004},
	publisher = {Prentice Hall},
}
@book{wolfram2002new,
	author = {Wolfram, Stephen},
	title = {{A New Kind of Science}},
	year = {2002},
	location = {Champaign, IL},
	publisher = {Wolfram Media},
}
@book{yates1987self-organizing,
	author = {Yates, F. E. and Garfinkel, A. and Walter, D. O. and Yates, G. B.},
	title = {{Self-Organizing Systems: The Emergence of Order}},
	year = {1987},
	location = {New York},
	publisher = {Plenum Press},
}
@misc{rfc3626,
	author = {Clausen, T. and Jacquet, P.},
	title = {{Optimized Link State Routing Protocol (OLSR)}},
	howpublished = {RFC 3626},
	year = {2003},
	month = {October},
}
@misc{rfc2131,
	author = {Droms, R.},
	title = {{Dynamic Host Configuration Protocol}},
	howpublished = {RFC 2131},
	year = {1997},
	month = {March},
}
@misc{rfc3736,
	author = {Droms, R.},
	title = {{Stateless Dynamic Host Configuration Protocol (DHCP) Service for IPv6}},
	howpublished = {RFC 3736},
	year = {2004},
	month = {April},
}
@misc{rfc1058,
	author = {Hedrick, C.},
	title = {{Routing Information Protocol}},
	howpublished = {RFC 1058},
	year = {1998},
	month = {June},
}
@misc{rfc4728,
	author = {Johnson, David B. and Hu, Y. and Maltz, David A.},
	title = {{The Dynamic Source Routing Protocol (DSR) for Mobile Ad Hoc Networks for IPv4}},
	howpublished = {RFC 4728},
	year = {2007},
	month = {February},
}
@misc{rfc1305,
	author = {l. Mills, David},
	title = {{Network Time Protocol(Version 3) Specification, Inplementation and Analysis}},
	howpublished = {RFC 1305},
	year = {1992},
	month = {March},
}
@misc{rfc3041,
	author = {Narten, T. and Draves, R.},
	title = {{Privacy Extensions for Stateless Address Autoconfiguration in IPv6}},
	howpublished = {RFC 3041},
	year = {2001},
	month = {January},
}
@misc{rfc3561,
	author = {Perkins, Charles E. and Belding-Royer, Elizabeth M. and Das, Samir R.},
	title = {{Ad hoc On-Demand Distance Vector (AODV) Routing}},
	howpublished = {RFC 3561},
	year = {2003},
	month = {July},
	abstract = {The Ad hoc On-Demand Distance Vector (AODV) routing protocol is intended for use by mobile nodes in an ad hoc network. It offers quick adaptation to dynamic link conditions, low processing and memory overhead, low network utilization, and determines unicast routes to destinations within the ad hoc network. It uses destination sequence numbers to ensure loop freedom at all times (even in the face of anomalous delivery of routing control messages), avoiding problems (such as "counting to infinity") associated with classical distance vector protocols.},
}
@inproceedings{dressler2004bio-inspired,
	author = {Dressler, Falko},
	title = {{Bio-inspired mechanisms for efficient and adaptive network security mechanisms}},
	booktitle = {Dagstuhl Seminar 04411 on Service Management and Self-Organization in IP-based Networks},
	year = {2004},
	month = {October},
	address = {Schloss Dagstuhl, Wadern, Germany},
}
@inproceedings{dressler2004cell,
	author = {Dressler, Falko and Kr\"{u}ger, Bettina},
	title = {{Cell biology as a key to computer networking}},
	booktitle = {German Conference on Bioinformatics 2004 (GCB'04), Poster Session},
	year = {2004},
	month = {October},
	address = {Bielefeld, Germany},
}
@inproceedings{krueger2004molecular,
	author = {Kr\"{u}ger, Bettina and Dressler, Falko},
	title = {{Molecular Processes as a Basis for Autonomous Networking}},
	booktitle = {International IPSI-2004 Stockholm Conference: Symposium on Challenges in the Internet and Interdisciplinary Research (IPSI-2004 Stockholm)},
	year = {2004},
	month = {September},
	address = {Stockholm, Sweden},
}
@inproceedings{dressler2005locality,
	author = {Dressler, Falko},
	title = {{Locality Driven Congestion Control in Self-Organizing Wireless Sensor Networks}},
	booktitle = {3rd International Conference on Pervasive Computing (Pervasive 2005): International Workshop on Software Architectures for Self-Organization, and Software Techniques for Embedded and Pervasive Systems (SASO+STEPS 2005)},
	year = {2005},
	month = {May},
	address = {Munich, Germany},
}
@inproceedings{dressler2005adaptive,
	author = {Dressler, Falko},
	title = {{Adaptive network monitoring for self-organizing network security mechanisms}},
	booktitle = {IFIP International Conference on Telecommunication Systems, Modeling and Analysis 2005 (ICTSM2005)},
	pages = {67-75},
	year = {2005},
	month = {November},
	address = {Dallas, TX, USA},
}
@inproceedings{dressler2005self-organization,
	author = {Dressler, Falko and Kr\"{u}ger, Bettina and Fuchs, Gerhard and German, Reinhard},
	title = {{Self-Organization in Sensor Networks using Bio-Inspired Mechanisms}},
	booktitle = {18th ACM/GI/ITG International Conference on Architecture of Computing Systems - System Aspects in Organic and Pervasive Computing (ARCS'05): Workshop Self-Organization and Emergence},
	pages = {139-144},
	year = {2005},
	month = {March},
	address = {Innsbruck, Austria},
}
@article{krueger2005molecular,
	author = {Kr\"{u}ger, Bettina and Dressler, Falko},
	title = {{Molecular Processes as a Basis for Autonomous Networking}},
	journal = {IPSI Transactions on Advances Research: Issues in Computer Science and Engineering},
	pages = {43-50},
	volume = {1},
	number = {1},
	year = {2005},
	month = {January},
}
@inproceedings{chen2006end-to-end,
	author = {Chen, Feng and Dressler, Falko and Heindl, Armin},
	title = {{End-to-End Performance Characteristics in Energy-Aware Wireless Sensor Networks}},
	booktitle = {Third ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks (ACM PE-WASUN'06)},
	pages = {41-47},
	year = {2006},
	month = {October},
	address = {Torremolinos, Malaga, Spain},
}
@techreport{dietrich2006lifetime,
	author = {Dietrich, Isabel and Dressler, Falko},
	title = {{On the Lifetime of Wireless Sensor Networks}},
	year = {2006},
	month = {December},
	institution = {University of Erlangen, Dept. of Computer Science 7},
	number = {04/06},
	type = {Technical Report},
}
@techreport{dressler2006self-organization-tutorial,
	author = {Dressler, Falko},
	title = {{Self-Organization in Autonomous Sensor/Actuator Networks}},
	year = {2006},
	month = {March},
	location = {Frankfurt, Germany},
	institution = {9th IEEE/ACM/GI/ITG International Conference on Architecture of Computing Systems - System Aspects in Organic Computing (ARCS'06)},
	type = {Tutorial},
}
@techreport{dressler2006self-organization,
	author = {Dressler, Falko},
	title = {{Self-Organization in Ad Hoc Networks: Overview and Classification}},
	year = {2006},
	month = {March},
	institution = {University of Erlangen, Dept. of Computer Science 7},
	number = {02/06},
	type = {Technical Report},
}
@inproceedings{dressler2006network-centric,
	author = {Dressler, Falko},
	title = {{Network-centric Actuation Control in Sensor/Actuator Networks based on Bio-inspired Technologies}},
	booktitle = {3rd IEEE International Conference on Mobile Ad Hoc and Sensor Systems (IEEE MASS 2006): 2nd International Workshop on Localized Communication and Topology Protocols for Ad hoc Networks (LOCAN 2006)},
	pages = {680-684},
	year = {2006},
	month = {October},
	address = {Vancouver, Canada},
}
@inproceedings{dressler2006bio-inspired,
	author = {Dressler, Falko},
	title = {{Bio-inspired Promoters and Inhibitors for Self-Organized Network Security Facilities}},
	booktitle = {1st IEEE/ACM International Conference on Bio-Inspired Models of Network, Information and Computing Systems (IEEE/ACM BIONETICS 2006)},
	year = {2006},
	month = {December},
	address = {Cavalese, Italy},
}
@techreport{dressler2006weighted,
	author = {Dressler, Falko},
	title = {{Weighted Probabilistic Data Dissemination (WPDD)}},
	year = {2006},
	month = {December},
	institution = {University of Erlangen, Dept. of Computer Science 7},
	number = {05/06},
	type = {Technical Report},
}
@inproceedings{dressler2006lifetime,
	author = {Dressler, Falko and Dietrich, Isabel},
	title = {{Lifetime Analysis in Heterogeneous Sensor Networks}},
	booktitle = {9th EUROMICRO Conference on Digital System Design - Architectures, Methods and Tools (DSD 2006)},
	pages = {606-613},
	year = {2006},
	month = {August},
	address = {Dubrovnik, Croatia},
}
@inproceedings{fuchs2006distributed,
	author = {Fuchs, Gerhard and Truchat, S\'{e}bastien and Dressler, Falko},
	title = {{Distributed Software Management in Sensor Networks using Profiling Techniques}},
	booktitle = {1st IEEE/ACM International Conference on Communication System Software and Middleware (IEEE/ACM COMSWARE 2006): 1st International Workshop on Software for Sensor Networks (SensorWare 2006)},
	pages = {1-6},
	year = {2006},
	month = {January},
	address = {New Dehli, India},
}
@inproceedings{labella2006bio-inspired,
	author = {Labella, Thomas Halva and Dressler, Falko},
	title = {{A Bio-Inspired Architecture for Division of Labour in SANETs}},
	booktitle = {1st IEEE/ACM International Conference on Bio-Inspired Models of Network, Information and Computing Systems (IEEE/ACM BIONETICS 2006)},
	year = {2006},
	month = {December},
	address = {Cavalese, Italy},
}
@inproceedings{labella2006simulation,
	author = {Labella, Thomas Halva and Fuchs, Gerhard and Dressler, Falko},
	title = {{A Simulation Model for Self-organised Management of Sensor/Actuator Networks}},
	booktitle = {GI/ITG KuVS Fachgespr\"{a}ch Selbstorganisierende, Adaptive, Kontextsensitive verteilte Systeme (SAKS)},
	year = {2006},
	month = {March},
	address = {Kassel, Germany},
}
@inproceedings{passing2006experimental,
	author = {Passing, Martin and Dressler, Falko},
	title = {{Experimental Performance Evaluation of Cryptographic Algorithms on Sensor Nodes}},
	booktitle = {3rd IEEE International Conference on Mobile Ad Hoc and Sensor Systems (IEEE MASS 2006): 2nd IEEE International Workshop on Wireless and Sensor Networks Security (WSNS'06)},
	pages = {882-887},
	year = {2006},
	month = {October},
	address = {Vancouver, Canada},
}
@article{truchat2006adaptive,
	author = {Truchat, S\'{e}bastien and Fuchs, Gerhard and Meyer, Steffen and Dressler, Falko},
	title = {{An Adaptive Model for Reconfigurable Autonomous Services using Profiling}},
	journal = {International Journal of Pervasive Computing and Communications (JPCC), Special Issue on Pervasive Management},
	pages = {247-259},
	volume = {2},
	number = {3},
	year = {2006},
	month = {September},
}
@inproceedings{yao2006on-demand,
	author = {Yao, Zheng and Lu, Zengyu and Marquardt, Holger and Fuchs, Gerhard and Truchat, S\'{e}bastien and Dressler, Falko},
	title = {{On-demand Software Management in Sensor Networks using Profiling Techniques}},
	booktitle = {7th ACM International Symposium on Mobile Ad Hoc Networking and Computing (ACM Mobihoc 2006): 2nd ACM International Workshop on Multi-hop Ad Hoc Networks: from theory to reality 2006 (ACM REALMAN 2006), Demo Session},
	pages = {113-115},
	year = {2006},
	month = {May},
	address = {Florence, Italy},
}
@inproceedings{dengler2007sensor-actuator,
	author = {Dengler, Sebastian and Awad, Abdalkarim and Dressler, Falko},
	title = {{Sensor/Actuator Networks in Smart Homes for Supporting Elderly and Handicapped People}},
	booktitle = {21st IEEE International Conference on Advanced Information Networking and Applications (AINA-07): First International Workshop on Smart Homes for Tele-Health (SmarTel'07)},
	pages = {863-868},
	volume = {II},
	year = {2007},
	month = {May},
	address = {Niagara Falls, Canada},
	publisher = {IEEE,},
}
@techreport{dietrich2007simulating,
	author = {Dietrich, Isabel and Sommer, Christoph and Dressler, Falko},
	title = {{Simulating DYMO in OMNeT++}},
	year = {2007},
	month = {April},
	institution = {University of Erlangen, Dept. of Computer Science 7},
	number = {01/07},
	type = {Technical Report},
}
@article{dressler2007bio-inspired,
	author = {Dressler, Falko},
	title = {{Bio-inspired Network-centric Operation and Control for Sensor/Actuator Networks}},
	journal = {Transactions on Computational Systems Biology (TCSB)},
	pages = {1-13},
	volume = {VIII},
	number = {LNCS 4780},
	year = {2007},
}
@techreport{dressler2007self-organization,
	author = {Dressler, Falko},
	title = {{Self-Organization in Autonomous Sensor/Actuator Networks}},
	year = {2007},
	month = {February},
	location = {Bern, Switzerland},
	institution = {15. GI/ITG Fachtagung Kommunikation in Verteilten Systemen (KiVS 2007)},
	type = {Tutorial},
}
@incollection{dressler2007self-organized,
	author = {Dressler, Falko},
	editor = {Dressler, Falko and Carreras, Iacopo},
	title = {{Self-Organized Network Security Facilities based on Bio-inspired Promoters and Inhibitors}},
	booktitle = {Advances in Biologically Inspired Information Systems - Models, Methods, and Tools},
	series = {Studies in Computational Intelligence (SCI)},
	pages = {81-98},
	volume = {69},
	year = {2007},
	address = {Berlin, Heidelberg, New York},
	publisher = {Springer},
	isbn = {978-3-540-72692-0},
}
@book{dressler2007advances,
	author = {Dressler, Falko and Carreras, Iacopo},
	title = {{Advances in Biologically Inspired Information Systems - Models, Methods, and Tools}},
	series = {Studies in Computational Intelligence (SCI)},
	volume = {69},
	year = {2007},
	location = {Berlin, Heidelberg, New York},
	publisher = {Springer},
	isbn = {978-3-540-72692-0},
}
@article{dressler2007dynamic,
	author = {Dressler, Falko and Chen, Feng},
	title = {{Dynamic Address Allocation for Self-organized Management and Control in Sensor Networks}},
	journal = {International Journal of Mobile Network Design and Innovation (IJMNDI)},
	pages = {116-124},
	volume = {2},
	number = {2},
	year = {2007},
}
@article{dressler2007profile-matching,
	author = {Dressler, Falko and Fuchs, Gerhard and Truchat, S\'{e}bastien and Yao, Zheng and Lu, Zengyu and Marquardt, Holger},
	title = {{Profile-Matching Techniques for On-demand Software Management in Sensor Networks}},
	journal = {EURASIP Journal on Wireless Communications and Networking (JWCN), Special Issue on Mobile Multi-Hop Ad Hoc Networks: from theory to reality},
	pages = {10, Article ID 80619},
	volume = {2007},
	year = {2007},
}
@incollection{labella2007bio-inspired,
	author = {Labella, Thomas Halva and Dressler, Falko},
	editor = {Dressler, Falko and Carreras, Iacopo},
	title = {{A Bio-Inspired Architecture for Division of Labour in SANETs}},
	booktitle = {Advances in Biologically Inspired Information Systems - Models, Methods, and Tools},
	series = {Studies in Computational Intelligence (SCI)},
	pages = {209-228},
	volume = {69},
	year = {2007},
	address = {Berlin, Heidelberg, New York},
	publisher = {Springer},
	isbn = {978-3-540-72692-0},
}
@inproceedings{schroeder-preikschat2007robust,
	author = {Schr\"{o}der-Preikschat, Wolfgang and Kapitza, R\"{u}diger and Klein\"{o}der, J\"{u}rgen and Felser, Meik and Karmeier, Katja and Labella, Thomas Halva and Dressler, Falko},
	title = {{Robust and Efficient Software Management in Sensor Networks}},
	booktitle = {2nd IEEE/ACM International Conference on Communication System Software and Middleware (IEEE/ACM COMSWARE 2007): 2nd IEEE/ACM International Workshop on Software for Sensor Networks (IEEE/ACM SensorWare 2007)},
	year = {2007},
	month = {January},
	address = {Bangalore, India},
	publisher = {IEEE},
}
@inproceedings{sommer2007dymo,
	author = {Sommer, Christoph and Dressler, Falko},
	title = {{The DYMO Routing Protocol in VANET Scenarios}},
	booktitle = {66th IEEE Vehicular Technology Conference (VTC2007-Fall)},
	pages = {16-20},
	year = {2007},
	month = {September/October},
	address = {Baltimore, Maryland, USA},
	publisher = {IEEE},
}
@inproceedings{yao2007dynamic,
	author = {Yao, Zheng and Dressler, Falko},
	title = {{Dynamic Address Allocation for Management and Control in Wireless Sensor Networks}},
	booktitle = {40th Hawaii International Conference on System Sciences (HICSS-40)},
	pages = {292b},
	year = {2007},
	month = {January},
	address = {Waikoloa, Big Island, Hawaii},
	publisher = {IEEE},
}
@article{aurenhammer1991voronoi,
	author = {Aurenhammer, Franz},
	title = {{Voronoi diagrams—a survey of a fundamental geometric data structure}},
	journal = {ACM Computing Surveys},
	pages = {345-405},
	volume = {23},
	number = {3},
	keywords = {triangulation, cell complex, clustering, combinatorial complexity, convex hull, crystal structure, divide-and-conquer, geometric data structure, growth model, higher dimensional embedding, hyperplane arrangement, k-set, motion planning, neighbor searching, object modeling, plane-sweep, proximity, randomized insertion, spanning tree},
	year = {1991},
}
@article{barabasi2004network,
	author = {Barab\'{a}si, Albert-L\'{a}szl\'{o} and Oltvai, Zolt\'{a}n N.},
	title = {{Network biology: understanding the cell's functional organization}},
	journal = {Nature Reviews Genetics},
	pages = {101-113},
	volume = {5},
	number = {2},
	year = {2004},
	month = {February},
}
@article{milo2002network,
	author = {Milo, R. and Shen-Orr, S. and Itzkovitz, S. and Kashtan, N. and Chklovskii, D. and Alon, U.},
	title = {{Network Motifs: Simple Building Blocks of Complex Networks}},
	journal = {Nature},
	pages = {824-827},
	volume = {298},
	year = {2002},
	month = {April},
}
@article{yeger-lotem2004network,
	author = {Yeger-Lotem, Esti and Sattath, Shmuel and Kashtan, Nadav and Itzkovitz, Shalev and Milo, Ron and Pinter, Ron Y. and Alon, Uri and Margalit, Hanah},
	title = {{Network motifs in integrated cellular networks of transcription–regulation and protein–protein interaction}},
	journal = {PNAS},
	pages = {5934-5939},
	volume = {101},
	number = {16},
	year = {2004},
	month = {April},
}
@article{webb2000what,
	author = {Webb, Barbara},
	title = {{What does robotics offer animal behaviour?}},
	journal = {Animal Behavior},
	pages = {545-558},
	volume = {60},
	number = {5},
	year = {2000},
}
@article{zykov1998wave,
	author = {Zykov, V. S. and Mikhailov, A. S. and M\"{u}ller, S. C.},
	title = {{Wave Instabilities in Excitable Media with fast Inhibitor Diffusion}},
	journal = {Physical Review Letters},
	pages = {2811-2814},
	volume = {81},
	number = {13},
	year = {1998},
	month = {September},
}
@techreport{draft-bernardos-manet-autoconf-survey,
	author = {Bernardos, C. and Calderon, M.},
	title = {{{Survey of IP address autoconfiguration mechanisms for MANETs}}},
	year = {2005},
	month = {January},
	number = {draft-bernardos-manet-autoconf-survey-00.txt},
	type = {Internet-Draft (work in progress)},
}
@techreport{draft-ietf-manet-dymo,
	author = {Chakeres, Ian and Perkins, Charles},
	title = {{{Dynamic MANET On-Demand (DYMO) Routing}}},
	year = {2007},
	month = {July},
	number = {draft-ietf-manet-dymo-10.txt},
	type = {Internet-Draft (work in progress)},
}
@techreport{draft-ietf-manet-nhdp,
	author = {Clausen, T. and Dearlove, C. and Dean, J.},
	title = {{{MANET Neighborhood Discovery Protocol (NHDP)}}},
	year = {2006},
	month = {June},
	number = {draft-ietf-manet-nhdp-00.txt},
	type = {Internet-Draft (work in progress)},
}
@techreport{draft-ietf-manet-zone-zrp,
	author = {Haas, Zygmunt J. and Pearlman, Marc R. and Samar, Prince},
	title = {{{The Zone Routing Protocol (ZRP) for Ad Hoc Networks}}},
	year = {2002},
	month = {July},
	number = {draft-ietf-manet-zone-zrp-04.txt},
	type = {Internet-Draft (work in progress)},
}
@techreport{draft-ietf-manet-autoconf,
	author = {Perkins, Charles E. and Malinen, Jari T. and Wakikawa, Ryuji and Belding-Royer, Elizabeth M. and Sun, Yuan},
	title = {{{IP Address Autoconfiguration for Ad Hoc Networks}}},
	year = {2001},
	month = {November},
	number = {draft-ietf-manet-autoconf-01.txt},
	type = {Internet-Draft (work in progress)},
}