Gang CHENG , Mei SONG , Yong ZHANG , Yi-hai XING , Xu-yan BAO
{"title":"机会网络中基于社会特征的路由协议","authors":"Gang CHENG , Mei SONG , Yong ZHANG , Yi-hai XING , Xu-yan BAO","doi":"10.1016/S1005-8885(14)60270-3","DOIUrl":null,"url":null,"abstract":"<div><p>Opportunistic networks are derived from delay tolerant networks, where mobile nodes have no end-to-end connections. Nodes are represented by people, which means that opportunistic networks can be regarded as social networks. Human mobility plays an important role in affecting the performance of forwarding protocols in social networks, furthermore, the trajectory of people's movements are driven by social characteristics. However, current routing protocols rely on simple mobility models, and rarely consider social characteristics. Considering two heterogeneous network models, an social opportunistic networks routing (SONR) was proposed which brings an adapted discrete Markov chain into nodes' mobility model and calculates the transition probability between successive status. Comparison was made between Spray, Wait and Epidemic protocol. Simulation show that SONR can improve performance on delivery ratio, delivery latency and network overhead, meanwhile. SONR approaches the performance of Epidemic routing.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"21 1","pages":"Pages 67-73, 103"},"PeriodicalIF":0.0000,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60270-3","citationCount":"5","resultStr":"{\"title\":\"Routing protocol based on social characteristics for opportunistic networks\",\"authors\":\"Gang CHENG , Mei SONG , Yong ZHANG , Yi-hai XING , Xu-yan BAO\",\"doi\":\"10.1016/S1005-8885(14)60270-3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Opportunistic networks are derived from delay tolerant networks, where mobile nodes have no end-to-end connections. Nodes are represented by people, which means that opportunistic networks can be regarded as social networks. Human mobility plays an important role in affecting the performance of forwarding protocols in social networks, furthermore, the trajectory of people's movements are driven by social characteristics. However, current routing protocols rely on simple mobility models, and rarely consider social characteristics. Considering two heterogeneous network models, an social opportunistic networks routing (SONR) was proposed which brings an adapted discrete Markov chain into nodes' mobility model and calculates the transition probability between successive status. Comparison was made between Spray, Wait and Epidemic protocol. Simulation show that SONR can improve performance on delivery ratio, delivery latency and network overhead, meanwhile. SONR approaches the performance of Epidemic routing.</p></div>\",\"PeriodicalId\":35359,\"journal\":{\"name\":\"Journal of China Universities of Posts and Telecommunications\",\"volume\":\"21 1\",\"pages\":\"Pages 67-73, 103\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60270-3\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of China Universities of Posts and Telecommunications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1005888514602703\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Computer Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of China Universities of Posts and Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1005888514602703","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Computer Science","Score":null,"Total":0}
Routing protocol based on social characteristics for opportunistic networks
Opportunistic networks are derived from delay tolerant networks, where mobile nodes have no end-to-end connections. Nodes are represented by people, which means that opportunistic networks can be regarded as social networks. Human mobility plays an important role in affecting the performance of forwarding protocols in social networks, furthermore, the trajectory of people's movements are driven by social characteristics. However, current routing protocols rely on simple mobility models, and rarely consider social characteristics. Considering two heterogeneous network models, an social opportunistic networks routing (SONR) was proposed which brings an adapted discrete Markov chain into nodes' mobility model and calculates the transition probability between successive status. Comparison was made between Spray, Wait and Epidemic protocol. Simulation show that SONR can improve performance on delivery ratio, delivery latency and network overhead, meanwhile. SONR approaches the performance of Epidemic routing.