.png){kind=icon}
.png){kind=icon}
Return
JAID: An algorithm for data fusion and jamming avoidance on distributed sensor networks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.pmcj.2008.06.001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Mobile Agent (MA) technology has been recently proposed in Wireless SensorNetworks (WSNs) literature to answer the scalability problem of client/server model in datafusion applications. In this paper, we describe the critical role MAs can play in the field of security and robustness of a WSN in addition to datafusion. The design objective of our JammingAvoidance Itinerary Design (JAID) algorithm is twofold: (a) to calculate near-optimal routes for MAs that incrementally fuse the data as they visit the nodes; (b) in the face of jamming attacks against the WSN, to modify the itineraries of the MAs to bypass the jammed area(s) while not disrupting the efficient data dissemination from working sensors. If the number of jammed nodes is small, JAID only modifies the pre-jamming scheduled itineraries to increase the algorithms promptness. Otherwise, JAID re-constructs the agent itineraries excluding the jammed area(s). Another important feature of JAID is the suppression of data taken from sensors when the associated successive readings do not vary significantly. Data suppression also occurs when sensors readings are identical to those of their neighboring sensors. Simulation results confirm that JAID enables retrieval of information from the working sensors of partially jammed WSNs and verifies its performance gain over alternative approaches in datafusion tasks.
Keywords:
Wireless sensornetworks
Mobile agents
Jammingavoidance
Routing
Data fusion
Itineraries
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.5
Papers:
1.5K
Citations:
2.2K