ASH: tackling node mobility in large-scale networks

1. Abbasi AA, Younis M (2007) A survey on clustering algorithms for wireless sensor networks. Comput Commun 30(14–15): 2826–2841

   Article  Google Scholar 

2. Abelson H, Allen D, Coore D, Hanson C, Homsy G, Knight TF Jr, Nagpal R, Rauch E, Sussman GJ, Weiss R (2000) Amorphous computing. Commun ACM 43(5): 74–82

   Article  Google Scholar 

3. Akyildiz IF, Estrin D, Culler DE, Srivastava MB (eds) (2003) In: Proceedings of the 1st international conference on embedded networked sensor systems, SenSys 2003, Los Angeles, California, USA, November 5–7, 2003. ACM

4. Avin C, Brito C (2004) Efficient and robust query processing in dynamic environments using random walk techniques. In: IPSN 2004, pp 277–286

5. Bastien C, Michel D (2005) Cellular automata modeling of physical systems. Cambridge University Press, Cambridge

   Google Scholar 

6. Bettstetter C (2001) International workshop on modeling analysis and simulation of wireless and mobile systems. In: MSWIM 2001, pp 19–27

7. Camp T, Boleng J, Davies V (2002) A survey of mobility models for ad hoc network research. Wirel Commun Mobile Comput 2(5): 483–502

   Article  Google Scholar 

8. Chaintreau A, Le Boudec J-Y, Ristanovic N (2009) The age of gossip: spatial mean field regime. In: SIGMETRICS/Performance 2009, pp 109–120

9. Chu T, Nikolaidis I (2004) Node density and connectivity properties of the random waypoint model. Comput Commun 27(10): 914–922 (Protocol engineering for wired and wireless networks)

   Article  Google Scholar 

10. De Rosa M, Goldstein S, Lee P, Pillai P, Campbell J (2008) Programming modular robots with locally distributed predicates. In Robotics and Automation, 2008. ICRA 2008. IEEE International Conference on pages 3156–3162. IEEE

11. Degesys J, Rose I, Patel A, Nagpal R (2007) Desync: self-organizing desynchronization and tdma on wireless sensor networks. In: IPSN 2007

12. Dhurandher SK, Singh GV (2005) Weight based adaptive clustering in wireless ad hoc networks. In: ICPWC 2005, pp 95–100

13. Dimakis A, Rabbat M (2005) Gossip and message-passing algorithms for sensor networks. IEEE Trans Inf Theory 58(3): 1731–1742

    Google Scholar 

14. Goldstein Seth C, Campbell JD, Mowry TC (2005) Programmable matter. IEEE Comput 38(6): 99–101

    Article  Google Scholar 

15. Grossglauser M, Tse David NC (2002) Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Trans Netw 10(4): 477–486

    Article  Google Scholar 

16. Gupta P, Kumar PR (2000) The capacity of wireless networks. IEEE Trans Inf Theory 46(2): 388–404

    Article  MathSciNet  MATH  Google Scholar 

17. Heinzelman WR, Ch A, Balakrishnan H (2000) Energy-efficient communication protocol for wireless microsensor networks. In: HICSS 2000, pp 3005–3014

18. Hnat TW, Sookoor TI, Hooimeijer P, Weimer W, Whitehouse K (2008) Macrolab: a vector-based macroprogramming framework for cyber-physical systems. In: SenSys 2008

19. Iwanicki K, van Steen M (2010) Gossip-based self-management of a recursive area hierarchy for large wireless sensornets. IEEE Trans Parallel Distrib Syst 21(4): 562–576

    Article  Google Scholar 

20. Jardosh A, Belding-Royer EM, Almeroth KC, Suri S (2003) Towards realistic mobility models for mobile ad hoc networks. In: MobiCom 2003

21. Johnson DB, Maltz DA (1996) Dynamic source routing in ad hoc wireless networks. In: Mobile Computing 1996

22. Karpelson M, Wei G-Y, Wood RJ (2009) Milligram-scale high-voltage power electronics for piezoelectric microrobots. In: ICRA 2009

23. Kempe D, Dobra A, Gehrke J (2003) Gossip-based computation of aggregate information. In: FOCS 2003

24. Khelil A, Becker C, Tian J, Rothermel K (2002) An epidemic model for information diffusion in manets. In: MSWiM 2002, pp 54–60

25. Lee K, Hong S, Kim SJ, Rhee I, Chong S (2009) Slaw: a mobility model for human walks. In: INFOCOM 2009, IEEE, pp 855–863

26. Mitchell M (2009) Complexity: a guided tour. Oxford University Press, Inc., New York

    MATH  Google Scholar 

27. Royer EM, Melliar-Smith PM, Moser LE (2001) An analysis of the optimum node density for ad hoc mobile networks. In: ICC 2001, pp 857–861

28. Sarwate AD, Dimakis AG (2009) The impact of mobility on gossip algorithms. In: INFOCOM 2009, IEEE 10

29. Werner-Allen G, Tewari G, Patel A, Welsh M, Nagpal R (2005) Firefly-inspired sensor network synchronicity with realistic radio effects. In: SENSYS 2005

30. Xu K, Hong X, Gerla M (2002) An ad hoc network with mobile backbones. In: Communications, 2002. ICC 2002. IEEE international conference on vol 5. IEEE, pp 3138–3143

31. Yamins D (2008) A theory of local-to-global algorithms for one-dimensional spatial multi-agent systems. PhD thesis, Harvard, Cambridge, MA, USA, Adviser-Nagpal, Radhika

32. Youssef MA, Youssef A, Younis MF (2009) Overlapping multihop clustering for wireless sensor networks. In: IEEE transactions on parallel and distributed systems, pp 1844–1856

33. Yu JY, Chong PHJ (2005) A survey of clustering schemes for mobile ad hoc networks. IEEE Commun Surv Tutor 7(1): 32–48 (qtr. 2005)

    Article  Google Scholar 

34. Zhang Y, Ng JM, Low CP (2009) A distributed group mobility adaptive clustering algorithm for mobile ad hoc networks. Comput Commun 32(1): 189–202

    Article  Google Scholar 

35. Zorzi M, Rao RR (2003) Geographic random forwarding (geraf) for ad hoc and sensor networks: energy and latency performance. In: IEEE Transactions on Mobile Computing, 2003

36. Zuniga M, Avin C, Hauswirth M (2010) Querying dynamic wireless sensor networks with non-revisiting random walks. In: EWSN 2010, pp 49–64

Download references