Abstract
With advances in miniaturization, wireless communication, and the theory of self-organizing systems, it has become possible to consider scenarios where a very large number of networkable sensors are deployed randomly over an extended environment and organize themselves into a network. Such networks — which we term large-scale sensor networks (LSSN’s) — can be useful in many situations, including military surveillance, environmental monitoring, disaster relief, etc. The idea is that, by deploying an LSSN, an extended environment can be rendered observable for an external user (e.g., a monitoring station) or for users within the system (e.g., persons walking around with palm-sized devices). Unlike custom-designed networks, these randomly deployed networks need no pre-design and configure themselves through a process of self-organization. The sensor nodes themselves are typically anonymous, and information is addressed by location or attribute rather than by node ID. This approach provides several advantages, including: 1) Scalability; 2) Robustness; 3) Flexibility; 4) Expandability; and 5) Versatility. Indeed, this abstraction is implicit in such ideas as smart paint, smart dust, and smart matter.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
Arumugam, Rajkumar “SCRIBE: Self-Organized Contention and Routing in Broadcast Environments”, MS Thesis, University of Cincinnati, May, 2002
Hagino Hiroaki, Takahiro Hara, Masahiko Tsukamoto, Shojiro Nishio. “Store and Flood: A Packet Routing Protocol for Frequently Changing Topology with AD-Hoc Networks” IPSJ JOURNAL Abstract Vol.41 No.09–010.
Jain, Rahul, Anuj Puri, and Raja Sengupta, “Geographical Routing Using Partial Information for Wireless Ad Hoc Networks”, Technical Report M99/69, University of California, Berkeley Dec. 1999
Johnson David B., David A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks”, Mobile Computing, Kluwer (1996), 153–181.
Kleinrock, Leonard, J. Silvester, “Optimum Transmission Radii for Packet Radio Networks or Why Six is a Magic Number”, Proceedings of the IEEE National Telecommunications Conference, (Dec. 1978), 4.3.1–4.3.5.
Kleinrock, Leonard, F.A. Tobagi, “Packet switching in radio channels: Part-I-carrier sense multiple access modes and their throughput-delay characteristics”, IEEE Transactions in Communications, COM 23(12) (1975), 1400–1416.
Perkins, Charles E., and Elizabeth M. Royer, “Ad-hoc On-Demand Distance Vector Routing”, Proc. 2nd IEEE Wkshp. Mobile Comp. Sys. and Apps., (Feb. 1999), 90–100.
Perkins, Charles E., and Pravin Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers”, Comp. Commun. Rev., (Oct. 1994), 234–244.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 NECSI Cambridge, Massachusetts
About this paper
Cite this paper
Arumugam, R., Subramanian, V., Minai, A.A. (2008). Intelligent Broadcast For Large-Scale Sensor Networks. In: Minai, A.A., Bar-Yam, Y. (eds) Unifying Themes in Complex Systems IV. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73849-7_36
Download citation
DOI: https://doi.org/10.1007/978-3-540-73849-7_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73848-0
Online ISBN: 978-3-540-73849-7
eBook Packages: Physics and AstronomyPhysics and Astronomy (R0)