用于灾难管理中P2P通信的自组织消息传递基础设施

Michael Lescisin, Q. Mahmoud
{"title":"用于灾难管理中P2P通信的自组织消息传递基础设施","authors":"Michael Lescisin, Q. Mahmoud","doi":"10.1109/IHTC.2017.8058182","DOIUrl":null,"url":null,"abstract":"Traditional means of communication rely on a centralized service provider, which may not be functional in the wake of a disaster. With a traditional cellular service provider, when somebody (Alice) wants to send a text message to someone else (Bob), the message is sent from Alice's phone to a cellular network and then finally to Bob. This process happens regardless if they are located on opposite sides of the world or are in the same room. In this paper, we present the design and implementation of a peer-to-peer (P2P) network which will route text messages along the shortest reliable path. By “shortest path” we mean that if Alice and Bob's phones are in wireless range of each other, the message passes only through their phones over the wireless link. If Alice and Bob are located further apart and their wireless radios are out of range, then a repeater node which can be reached by both Alice and Bob can be deployed and the message will pass through this node, again taking the shortest path. The network can be deployed with inexpensive off-the-shelf microcomputers, such as the Raspberry Pi, which can run off batteries in the event of a power outage. These nodes can be easily deployed and need not be trusted as the messages are encrypted and signed. During our tests, we were able to send text messages across a building over our mesh-network composed of five Raspberry Pi microcomputers running our software and using ad-hoc Wi-Fi for neighbour-to-neighbour links.","PeriodicalId":284183,"journal":{"name":"2017 IEEE Canada International Humanitarian Technology Conference (IHTC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Ad-hoc messaging infrastructure for P2P communication in disaster management\",\"authors\":\"Michael Lescisin, Q. Mahmoud\",\"doi\":\"10.1109/IHTC.2017.8058182\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Traditional means of communication rely on a centralized service provider, which may not be functional in the wake of a disaster. With a traditional cellular service provider, when somebody (Alice) wants to send a text message to someone else (Bob), the message is sent from Alice's phone to a cellular network and then finally to Bob. This process happens regardless if they are located on opposite sides of the world or are in the same room. In this paper, we present the design and implementation of a peer-to-peer (P2P) network which will route text messages along the shortest reliable path. By “shortest path” we mean that if Alice and Bob's phones are in wireless range of each other, the message passes only through their phones over the wireless link. If Alice and Bob are located further apart and their wireless radios are out of range, then a repeater node which can be reached by both Alice and Bob can be deployed and the message will pass through this node, again taking the shortest path. The network can be deployed with inexpensive off-the-shelf microcomputers, such as the Raspberry Pi, which can run off batteries in the event of a power outage. These nodes can be easily deployed and need not be trusted as the messages are encrypted and signed. During our tests, we were able to send text messages across a building over our mesh-network composed of five Raspberry Pi microcomputers running our software and using ad-hoc Wi-Fi for neighbour-to-neighbour links.\",\"PeriodicalId\":284183,\"journal\":{\"name\":\"2017 IEEE Canada International Humanitarian Technology Conference (IHTC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE Canada International Humanitarian Technology Conference (IHTC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IHTC.2017.8058182\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE Canada International Humanitarian Technology Conference (IHTC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IHTC.2017.8058182","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

传统的通信方式依赖于集中的服务提供商,在灾难发生后可能无法正常工作。对于传统的移动电话服务提供商,当某人(Alice)想要给另一个人(Bob)发送短信时,信息从Alice的手机发送到移动电话网络,然后最后发送给Bob。无论他们是在世界的另一边还是在同一个房间里,这个过程都会发生。在本文中,我们提出了一个点对点(P2P)网络的设计和实现,该网络将沿着最短的可靠路径路由文本消息。我们所说的“最短路径”是指,如果Alice和Bob的手机都在对方的无线范围内,那么信息只能通过无线链路通过他们的手机传递。如果Alice和Bob相距较远,并且他们的无线无线电不在覆盖范围内,则可以部署一个Alice和Bob都可以到达的中继器节点,并且消息将通过该节点,再次采用最短路径。该网络可以部署在廉价的现成微型计算机上,比如树莓派(Raspberry Pi),它可以在停电时耗尽电池。这些节点可以很容易地部署,并且不需要信任,因为消息是加密和签名的。在我们的测试中,我们能够通过我们的网状网络在一栋楼里发送短信,网状网络由五台运行我们软件的树莓派微型计算机组成,并使用ad-hoc Wi-Fi进行邻居间的连接。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Ad-hoc messaging infrastructure for P2P communication in disaster management
Traditional means of communication rely on a centralized service provider, which may not be functional in the wake of a disaster. With a traditional cellular service provider, when somebody (Alice) wants to send a text message to someone else (Bob), the message is sent from Alice's phone to a cellular network and then finally to Bob. This process happens regardless if they are located on opposite sides of the world or are in the same room. In this paper, we present the design and implementation of a peer-to-peer (P2P) network which will route text messages along the shortest reliable path. By “shortest path” we mean that if Alice and Bob's phones are in wireless range of each other, the message passes only through their phones over the wireless link. If Alice and Bob are located further apart and their wireless radios are out of range, then a repeater node which can be reached by both Alice and Bob can be deployed and the message will pass through this node, again taking the shortest path. The network can be deployed with inexpensive off-the-shelf microcomputers, such as the Raspberry Pi, which can run off batteries in the event of a power outage. These nodes can be easily deployed and need not be trusted as the messages are encrypted and signed. During our tests, we were able to send text messages across a building over our mesh-network composed of five Raspberry Pi microcomputers running our software and using ad-hoc Wi-Fi for neighbour-to-neighbour links.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信