Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Ant Colonies for Adaptive Routing in Packet-Switched Communications Networks
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Wireless Sensor Networks: An Information Processing Approach
Wireless Sensor Networks: An Information Processing Approach
Energy and QoS Aware Routing in Wireless Sensor Networks
Cluster Computing
MANET simulation studies: the incredibles
ACM SIGMOBILE Mobile Computing and Communications Review - Special Issue on Medium Access and Call Admission Control Algorithms for Next Generation Wireless Networks.: The Digital Library version of this issue has a corrected special issue title compared to the one in the print version of the issue.
Fluid models for large-scale wireless sensor networks
Performance Evaluation
Energy-aware routing in sensor networks: A large system approach
Ad Hoc Networks
Computer
Analysis of On-off policies in Sensor Networks Using Interacting Markovian Agents
PERCOM '08 Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications
A formal performance modeling framework for bio-inspired ad hoc routing protocols
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Energy conservation in wireless sensor networks: A survey
Ad Hoc Networks
MeanField analysis for the evaluation of gossip protocols
ACM SIGMETRICS Performance Evaluation Review
Correctness of gossip-based membership under message loss
Proceedings of the 28th ACM symposium on Principles of distributed computing
Disaster Propagation in Heterogeneous Media via Markovian Agents
Critical Information Infrastructure Security
Stochastic geometry and random graphs for the analysis and design of wireless networks
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Analytical modeling of swarm intelligence in wireless sensor networks through Markovian agents
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
A framework and model for soft routing: the Markovian termite and other curious creatures
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
IEEE Communications Magazine
IEEE Communications Magazine
A tool suite for modelling spatial interdependencies of distributed systems with markovian agents
EPEW'11 Proceedings of the 8th European conference on Computer Performance Engineering
Moment closures for performance models with highly non-linear rates
EPEW'12 Proceedings of the 9th European conference on Computer Performance Engineering
PCTMC models of wireless sensor network protocols
EPEW'12 Proceedings of the 9th European conference on Computer Performance Engineering
Moment closures for performance models with highly non-linear rates
EPEW'12 Proceedings of the 9th European conference on Computer Performance Engineering
PCTMC models of wireless sensor network protocols
EPEW'12 Proceedings of the 9th European conference on Computer Performance Engineering
Mean-field analysis of data flows in wireless sensor networks
Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering
Hi-index | 0.00 |
Wireless Sensor Networks (WSN) are large networks of tiny sensor nodes that are usually randomly distributed over a geographical region. The network topology may vary in time in an unpredictable manner due to many different causes. For example, in order to reduce power consumption, battery operated sensors undergo cycles of sleeping-active periods; additionally, sensors may be located in hostile environments increasing their likelihood of failure; furthermore, data might also be collected from a range of sources at different times. For this reason multi-hop routing algorithms used to route messages from a sensor node to a sink should be rapidly adaptable to the changing topology. Swarm intelligence has been proposed for this purpose, since it allows the emergence of a single global behavior from the interaction of many simple local agents. Swarm intelligent routing has been traditionally studied by resorting to simulation. The present paper aims to show that the recently proposed modeling technique, known as Markovian Agent Model (MAM), is suited for implementing swarm intelligent algorithms for large networks of interacting sensors. Various experimental results and quantitative performance indices are evaluated to support this claim. The validity of this approach is given a further proof by comparing the results with those obtained by using a WSN discrete event simulator.