Multi-factor prediction routing protocol based on characteristic categorization of opportunistic networks

Zhejiang Daxue Xuebao(Gongxue Ban)/Journal of Zhejiang University (Engineering Science)

Volumn 44, Issue 3, 2010, Pages 413-419

  Zhou, Qiang ^a   Ying, Jing ^a,b   Wu, Ming Hui ^a,b  

^a ZHEJIANG UNIVERSITY   (China)

^b ZHEJIANG UNIVERSITY CITY COLLEGE   (China)

Author keywords

Characteristic of nodes; Network categorization; Opportunistic networks; Routing protocol

Indexed keywords

CHARACTERISTIC OF NODES; EFFICIENT ROUTING; EVALUATION CRITERIA; HEURISTIC RULES; HYBRID ROUTING PROTOCOLS; MULTI-FACTOR; OPPORTUNISTIC NETWORKS;

FORECASTING; QUALITY ASSURANCE; REDUNDANCY; WIRELESS NETWORKS;

ROUTING PROTOCOLS;

EID: 77952592948     PISSN: 1008973X     EISSN: None     Source Type: Journal    
DOI: 10.3785/j.issn.1008-973X.2010.03.001     Document Type: Article

References (18)

1. Fall K. A delay-tolerant network architecture for challenged Internets[C]//Proceedings of the 2003 Conference on applications, Technologies, Architectures, and Protocols for Computer Communications. Karlsruhe: ACM, 2003: 27-34.
2. Pelusi L, Passarella A, Conti M. Opportunistic networking: data forwarding in disconnected mobile ad hoc networks[J]. Communications Magazine, 2006, 44(11): 134-141.
3. Xiong Yong-Ping, Sun Li-Min, Niu Jian-Wei, et al. Opportunistic networks[J]. Journal of Software, 2009, 20(1): 124-137.
4. Juang P, Oki H, Wang Yong, et al. Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet[C]//Proceedings of the 10 th Int'l Conf on Architectural Support for Programming Languages and Operating Systems. New York: ACM, 2002: 96-107.
5. Small T, Hass Z. The shared wireless infostation model: a new ad hoc networking paradigm (or where there is a whale, there is a way)[C]// Proceedings of the 4th ACM Int'l Symp. on Mobile Ad Hoc Networking. Annapolis: ACM, 2003: 233-244.
6. Pan H, Chaintreau A, Scott J, et al. Pocket switched networks and human mobility in conference environments[C]//Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking. Philadelphia: ACM, 2005: 244-251.
7. Spyropoulos T, Psounis K, Raghavendra C S. Performance analysis of mobility-assisted routing[C]//Proceedings of the 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing. Florence: ACM, 2006: 22-25.
8. Abdulla M, Simon R. Characteristics of common mobility models for opportunistic networks[C]// Proceedings of the 2nd ACM Workshop on Performance monitoring and Measurement of Heterogeneous Wireless and Wired Networks. Chania: ACM, 2007: 105-109.
9. Boldrini C, Conti M, Passarella A. ContentPlace: social-aware data dissemination in opportunistic networks[C]//Proceedings of the 11th International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems. Vancouver: ACM, 2008: 203-210.
10. Boldrini C, Conti M, Passarella A. Modelling data dissemination in opportunistic networks[C]//Proceedings of the Third ACM Workshop on Challenged Networks. San Francisco: ACM, 2008: 89-96.
11. Pan H, Crowcroft J. How small labels create big improvements[C]//Proceedings of the 2006 ACM CoNEXT Conference. Lisboa: ACM, 2006: Article No. 34.
12. Campbell A, Eisenman S, Lane N, et al. People-centric urban sensing[C]//Proceedings of the 2nd Annual International Workshop on Wireless Internet. Boston: ACM, 2006: Article No. 18.
13. Henderson T, Kotz D, Abyzov I. The changing usage of a mature campus-wide wireless network[C]//Proceedings of the 10 th Annual International Conference on Mobile Computing and Networking. Philadelphia: ACM, 2004: 187-201.
14. Chiou C, Chen L. Poster Abstract: an evaluation study of routing reliability in opportunistic networks[C]//Proceedings of the 9th ACM International Symposium on Mobile ad hoc Networking and Computing. Hong Kong: ACM, 2008: 455-456.
15. Song Li-Bo, Kotz D F. Evaluating opportunistic routing protocols with large realistic contact traces[C]//Proceedings of the Second ACM Workshop on Challenged Networks. Montreal: ACM, 2007: 3542.
16. Vahdat A, Becker D. Epidemic Routing For Partially-Connected Ad Hoc Networks[R]. Technical Report CS-2000-06, Durham: Duke University, 2000.
17. Chen L, Yu C, Sun T, et al. A Hybrid routing approach for opportunistic networks[C]//Proceedings of the 2006 SIGCOMM Workshop on Challenged Networks. Pisa: ACM, 2006: 213-220.
18. Lindgren A, Doria A, Schelen O. Probabilistic routing in intermittently connected networks[J]. ACM SIGMOBILE Mobile Computing and Communications Review, 2003, 7(3): 19-20.