Abstract
An increasing number of distributed sensor networks are being deployed in a wide spectrum of scenarios for both military and civilian applications. The design of such systems requires the integration of many methods for solving various problems ranging from sensor deployment, through data communication, information fusion to environmental inference and hypothesis testing. This paper is focused on the network aspects in support of data communication services. We present some recent developments in networking techniques for multiple sensor systems in three topics: efficient mobile agent routing in mobile agent-based distributed sensor networks, bandwidth aggregation using multiple paths in wide-area wireline networks, and connectivity enhancement using node movements in small-area wireless mobile ad-hoc networks.
Highlights
Sensor networks have become an important research area and attracted a great deal of attention during the past decade
We propose an approximate solution based on a two-level genetic algorithm (GA) and compare the simulation results with those computed by two other heuristics, namely Local Closest First (LCF) and Global Closest First (GCF)
We presented some recent developments of networking techniques in distributed sensor networks
Summary
Sensor networks have become an important research area and attracted a great deal of attention during the past decade. Instead of sending all sensor data to the processing element, which performs a one-time data fusion as in a conventional server/client system, the mobile agent-based distributed sensor network (MADSN) proposed in [1] enables the computation to be spread out onto the participating leaf nodes with the intention of decreasing the consumption of scarce network resources (mostly the bandwidth) and the risk of being spied with hostile intent. The communication among moving nodes via conventional Transmission Control Protocol (TCP) byte-streams may experience difficulties that are not involved in wired networks because TCP needs the support of underlying routers and requires a direct or indirect connection between the source and destination nodes exist during the entire period of transmission To meet these challenges, we design a novel transmission control and routing mechanism based on Connectivity-Through-Time (CTT) algorithm.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
