Research Article | Open Access
Mauro Margalho Coutinho, Alon Efrat, Thienne Johnson, Andrea Richa, Mengxue Liu, "Healthcare Supported by Data Mule Networks in Remote Communities of the Amazon Region", International Scholarly Research Notices, vol. 2014, Article ID 730760, 8 pages, 2014. https://doi.org/10.1155/2014/730760
Healthcare Supported by Data Mule Networks in Remote Communities of the Amazon Region
This paper investigates the feasibility of using boats as data mule nodes, carrying medical ultrasound videos from remote and isolated communities in the Amazon region in Brazil, to the main city of that area. The videos will be used by physicians to perform remote analysis and follow-up routine of prenatal examinations of pregnant women. Two open source simulators (the ONE and NS-2) were used to evaluate the results obtained utilizing a CoDPON (continuous displacement plan oriented network). The simulations took into account the connection times between the network nodes (boats) and the number of nodes on each boat route.
Data mule is an acronym for (mobile ubiquitous LAN extension). It is related to vehicles that physically carry a computer with a storage device and a limited telecommunication module (usually Wi-Fi) between remote areas in order to effectively create a data communication link . A delay-tolerant network (DTN) is an architecture that provides a common method for interconnecting heterogeneous gateways or proxies that employ store-and-forward message routing to overcome communication disruptions . Both technologies are tolerant to disconnections in the network and are often complementary. However, despite the fact that these technologies do not adhere to the principle of ubiquitous computing, they open the doors to hundreds of applications whose integration was not possible earlier, mostly due to the high costs, or even infeasibility, of implementing a networked infrastructure in some scenarios.
One of these scenarios is the Marajó Archipelago, located in the Amazon region of Brazil, which occupies a large fluvial area of 104,142 Km2 (approximately 40,700 sq mi) . The largest island on the archipelago, the Marajo Island, has roughly the same size as Switzerland and is the largest island in the world to be surrounded by freshwater. According to the last Brazilian census , only 43% of the archipelago’s population of 487,010 inhabitants lives in urban areas. There are no bridges linking the islands to the mainland, and boats are by far the main means of transportation in the region. Some cities, like Afua (known as the “Venice of the Amazon”), are completely built on water. In these places, socioinfrastructure problems abound, especially health related problems, as there are few physicians available in the remote communities. Most medical care is done through sporadic government programs that involve the displacement of a team to serve the population, in particular in the outlying areas. The goal of this paper is to present an alternative telemedicine infrastructure, focused on performing remote triage and prioritization of medical care in these remote regions of the Amazon rain forest. We implement a telemedicine infrastructure over a CoDPON (continuous displacement plan oriented network) data mule system , commonly applied in scenarios where nodes have predefined routes. We present a preliminary evaluation of the capabilities of our proposed telemedicine infrastructure by means of simulations. We simulate the implementation of a remote ultrasound video analysis service for pregnant women in the Marajó Archipelago, as part of their prenatal treatment, over our data mule network.
This paper is organized as follows: Section 2 presents related work, Section 3 presents the system architecture, Section 4 presents a description of the remote ultrasound telemedicine application, and Section 5 presents our simulation studies. Section 6 concludes this work and presents suggestions for the improvement of services through the use of fountain codes.
2. Related Work
2.1. DTN and Data Mule
The first terrestrial DTN applications were proposed for sensor networks [6–8]. Soon other applications emerged for integration of remote communities like Daknet  that provided low-cost digital communication, allowing remote villages to leap from the expense of traditional connectivity solutions and the deployment of a full-coverage broadband wireless infrastructure. Another proposal, named MotoPost, was presented in . The concept was developed to address the communication and information access needs of remote rural villages in India that do not have access to communication technologies.
The epidemic routing is a routing protocol for DTN. This algorithm is named this way because messages are spread like infectious diseases : when two nodes come into contact, the first node sends the second node a summary vector containing information that uniquely identifies the bundles of information (messages) it has. The second node then sends the first node any bundles that it has and the first does not have. This takes place in both directions whenever two nodes come into contact . For a moderate volume of data, epidemic routing is considered as one of the most effective routing schemes for delay-tolerant networks; indeed, epidemic routing allows for the shortest routing delays .
These and other efforts sensitized the scientific community to produce new tools to evaluate the impact of DTNs in different scenarios. One of the most popular DTN simulators “the ONE” —opportunistic network environment—has rich features available for simulating DTNs with numerous mobility models. It is a useful tool for platform for implementation and evaluations of new ideas. Recently, Khalid et al.  evaluated the concept of checkpoint (CP). CPs are autonomous high-end wireless devices with a large buffer for storage and are responsible for temporarily storing messages to be forwarded. According to the authors, the basic components of a CP node are processor, memory, solar powered batteries, multiple interfaces (standard Ethernet; 802.11b/g/n; Bluetooth), GPS, and storage. The results of simulation in an area of 4 × 3 KM (the size of the city of Fargo, ND, USA) show that message delivery ratio improves by increasing the number of checkpoints in the area.
2.2. “Store-and-Forward” Telemedicine
In scenarios where real-time communication network might not be a practical solution for the delivery of large files, “store-and-forward” approaches could come in handy. Typically these systems encapsulate and then transmit medical information to the recipient, without accepting immediate acknowledgment. These methods might be required due to cost constraints. Examples of “store-and-forward” include correspondence via e-mail, fax, or data mule. The main advantage of this form of telemedicine is that no online services are required and the content of the information can be examined as soon as possible . The use of delay tolerance network infrastructure to provide telemedicine in remote areas has also been investigated in , and a simple telemedicine system using a digital camera was evaluated in . In that test bed, radiographs on a viewing box were photographed at a remote hospital in South Africa, using a digital camera, and the resultant images were stored in JPEG format and transmitted, later to be read on a PC monitor by radiologists in Durban and Cape Town.
3. CoDPON Architecture
CoDPON network, proposed in , is a specific data mule system inspired by the air traffic control system. It basically consists of four components: nodes, DACT (data application in transit, data divided into logical units), displacement plans, and the communication protocol. There are three types of nodes: vehicles, peers base stations (PBSs), and hot spots. Vehicles (in our case, boats) act as mules, carrying the data spread along the path. The vehicles used on a CoDPON network operate on predefined routes, with prescheduled (days and times) departures and arrivals. All boats have a computer housed in an airtight box and use solid state disks to ensure more robust and persistent storage. The solid state is to prevent damage due to motion of boats.
Peer base stations are fixed nodes, previously mapped, where vehicles make scheduled stops. Peer base stations are usually located on the river shore. Hot spots are special nodes that exist only in areas that have connection to the Internet. They work as a faster gateway between CoDPON nodes. Unfortunately, solutions such as the ones proposed in , which reduce latencies equipping the MULEs with an always-on connection (such as a cellular or satellite phone), are not available in some scenarios (e.g., there is a very limited telecommunications coverage in Amazonia). A DACT represents a minimum unit of data transferred between nodes and has a self-meaning that allows pieces of data to be separated from others without losing consistency.
A displacement plan is applied to all boats. It contains basic information about the entire route of the boat, including starting point, destination, stopovers, and estimated time of journey and anchoring. Journey time is the time required for a boat to travel its entire route. Anchor time usually is the time for passengers to embark or disembark at village piers. Each boat has its own displacement plan stored on board, including a table containing the hydrographic distances between peer base stations.
The communication protocol is based on the principle of data mule. It does not require changes in the TCP stack, as is the case with the DTN. Mathematical models that can be referenced to support this project are found in .
A major difficulty for health care in isolated areas, like the Marajó Archipelago, occurs due to the small number of physicians who reside in the region. The vast majority of those just make periodic visits to the communities in the region. Among the most affected people by the infrequent medical visits in the communities are pregnant women, who need regular monitoring. Hence, we considered the proposed application of remote ultrasound monitoring. The CoDPON system will act as a data mule network, carrying and delivering ultrasound files from the remote communities (Figure 1) to the state capital, Belém, for analysis by physicians (Figure 2).
The ultrasound parameters used in the simulation process were obtained by consulting a team of experts on ultrasounds, including OBGyn doctors in Belém, who operate in the Marajó region. According to the team, the ultrasound examination is a dynamic diagnostic method in which the physicians acquire the ultrasound videos and interpret them in a dynamic way. Two synchronized videos are required for the remote analysis to be efficient: the first video shows the image generated by the equipment and the second video shows the examination process (the position of the transducer being used by health agent on the patient’s body).
Two open source simulation tools were selected for the evaluation of the scenario described in the Marajó Archipelago. The first software was NS-2, probably the most widely used simulator in the scientific community . The NS-2 wireless module was used to inspect the connection time between boats (in motion) and peer base stations and between a boat and another boat (both in motion) (Figure 3). The other software was the ONE simulator , which has rich features available for simulating DTNs with numerous mobility models.
For the simulation, an area of 104,142 Km2 (approximately 40,700 sq mi) comprising the Marajó Archipelago, located in the state of Pará, Brazil, was selected (the south part of the Marajo Island is shown in Figure 4). The routes for the boats were created according to local data, obtained from the office of the public boats terminal in the city of Belém (capital of Pará). The boats are equipped with Wi-Fi IEEE 802.11 devices and they follow routes throughout the simulation area, following predefined routes. Each boat has scheduled stopovers at various peer base stations.
5.2. Simulation Parameters
For the simulation, various combinations of parameters were selected (Table 1).
The scales of the simulations conducted in NS-2 and the ONE simulator were very different. In the simulation in NS-2, we evaluated the amount of data transmitted between boats and PBSs, which required a finer grain simulation and more specifics about the radio wave communications. The simulations conducted in the ONE simulator concerned the flow of packets over the network, following the end-to-end boat displacement plans.
As some routes are traveled for up to seventeen hours, the time to live (TTL) value was set to 1,122 minutes, 10% more than the value of the maximum travel time. When the TTL expires, the message will be self-destroyed, if it had not been delivered yet.
5.3. Traffic Generator
In order to configure the traffic generator for the simulator, the demand of real data loads in Marajó was investigated in loco. During the sporadic government health programs, physicians perform one hundred ultrasound exams in one weekend, once a month. In other words, working at maximum capacity, they perform fifty exams per weekend day. If we consider that each ultrasound size, in Mpeg format, is around 5 Megabytes (using the minimum acceptable standards for digital compression of a fetal ultrasound video clip ) and we add the video of a health agent performing the examination, 10 Megabytes is a reasonable size for each ultrasound video set. Thus, the traffic generator of the ONE simulator was set up to work at 384 kbps. The value was obtained considering that fifty ultrasounds per day are performed, each generating a 10 MB ultrasound file. Three PBSs, located at the extreme points of the Marajó Archipelago, were selected as sources of video transmissions, all of them sending files to the main PBS in Belém. The average boat speed of 15 Km/h was obtained by GPS in loco.
6.1. Simulation in NS2
Once a boat stops at a PBS, it could receive DACTs, due to its large buffer (SSD disk). Therefore, the investigations were concentrated in critical points, that is, when the data transfer occurs while the boats are moving. In the simulation, three different scenarios were tested.
Scenario 1 shows a boat passing within 50 meters of another boat in the opposite direction. In this case, both boats are in motion. Scenario 2 shows a boat passing within 50 meters of a peer base station, which is a fixed point, without stopping. Scenario 3 shows two boats in movement, moving in the same direction, and one is traveling at twice the speed of the other. In all scenarios, connection times and amount of data transferred were analyzed (Figure 5).
In the first scenario, transmission occurs between seconds 172 and 320 of the simulation time line, which represents a duration of 148 seconds. This results in a total of 2.3 minutes of connection time between the boats. This would allow for the transfer of two ultrasound video sets.
In the second scenario, transmission occurs between seconds 99 and 381 of the time line simulation, which represents a total of 282 seconds. This results in a total of 4.7 minutes of connection time between a boat and a PBS. With these values it would be possible to transfer 47.62 Megabytes, which would allow the transfer of four ultrasound video sets.
In the third scenario, transmission occurs between instants 198 and 760 of the time line simulation, which represents a total of 562 seconds. This results in a total of 9.36 minutes of connection time between the boats. With these values, 135.08 Megabytes would be transferred, which would allow the transmission of thirteen ultrasound exams sets (Figure 6).
6.2. Simulation in ONE
The map of the Marajó Archipelago was obtained from IDESP (Institute of Economic, Social and Environmental Development of Pará) . The map was post-processed using the open source GIS tool OpenJump, and marked with various locations such as villages, small cities, and the route of the boat lines.
The scenario used in this section aims to transfer ultrasound sets from remote communities of the Amazon to Belém. The ONE simulator scenario comprises 11 PBSs, and only three of them (PBS_Anajás, PBS_Bagre, and PBS_Soure) generated ultrasound exam files. Each boat has an associated route file defined by the OpenJump software, based on real routes obtained from the main boat station in Belém.
Epidemic routing was used in the simulations. The evaluation was performed by changing the number of boats not only between source and destination but also in the entire scenario. The metrics were compared with one boat, three boats, five boats, and seven boats acting in each route.
Figure 7 shows the relation between started, dropped, relayed, and aborted packets. Started packets are the packet transmissions started between network nodes. Dropped packets are the packets that are dropped from nodes’ buffers and relayed packets are the packets successfully transmitted between nodes. As it can be seen, the number of dropped packets rises with the number of boats, due to the epidemic routing, which indicates a rapid saturation of the network capacity. Basically this is due to having more boats carrying packets the “wrong” way (in the opposite direction of the PBS it should be going to), which end up “wandering” in the network without ever making it to Belém.
Despite the fact that the delivery probability increases with the increased number of boats (Figure 8), the amount of wandering packets in the network grows in a much larger proportion (Figure 9), also rapidly saturating the network capacity. This is clear when the overhead ratio is observed. For an epidemic-like protocol, the overhead ratio can be interpreted as the number of replicas for each message transmission. In an environment without QoS, this could be a problem because of the large amount of messages to be delivered.
Without a prioritization mechanism, the most important messages can be delivered later and may not be relayed in time. In a CoDPON network, QoS prioritization is based on the Olympic service (QoS architecture that classifies messages in gold, silver, and bronze: gold goes first and then silver, and bronze is considered the best effort)  to avoid this problem.
Figure 8 shows the delivery probability, which is the probability related to the number of successfully delivered messages. It grows linearly according to the increase in the number of boats. This information can be used by network administrators and local government to estimate how efficient the service is. Depending on the results, more boats can receive the necessary equipment to become nodes in a CoDPON network. Figure 10 shows the average message delay from creation to delivery. It drops as more boats are used to carry the packets.
The simulation performed can be used to scale the number of boats that will act as data mules in the system and the impact of the use of traditional routing protocols like epidemic routing, for example, to decrease the latency with an increased number of boats.
It is clear that the proposed system has a high delivery ratio with high overhead. But as our goal is to provide medical services to underserviced communities, the delivery of the messages is our priority; thus, the overhead is the issue that needs to be improved but it is acceptable as a starting point.
The demand for health services is large in the Amazon region. However, due to the lack of communication and transportation infrastructure, many patients who require special care end up unattended. One of the most important aspects of our proposed system refers to the inclusion of health experts in the patients’ medical files preliminary analysis. For example, if a large number of neurological problems are detected in the analysis of the remote preliminary examinations files, neurologists may be included in the group of doctors in the boat caravan to the villages.
The simulations in this paper clearly indicate that epidemic routing creates a very large burden on the network, since the packet spreads in all directions without discretion. In a network with known routes, as is the case of CoDPON, where the PBSs may act similar to checkpoint  spreading packets, the spread can be controlled to minimize the amount of unnecessary transfers, since there is some control available through the displacement plans.
8. Future Work
For future work, we are developing an algorithm that will diffuse messages according to the displacement plan of the boats in a controlled way. That algorithm will be implemented for the ONE simulator and the results will be compared with the existing implementation.
Another topic for further research is to evaluate how to reduce excessive messages sent via the epidemic routing protocol. The Spray and Wait  protocol limits the number of copied messages to a predefined maximum and distributes the copies to the contacted nodes until the maximum number of copies has been reached. Supp-Tran  optimizes the performance of epidemic routing protocol in terms of delivery probability, overhead ratio, and hop count average. Such approaches and other message distribution protocols will be evaluated to improve our system’s performance.
Since components of the proposed system might suffer unpredictable failures, robustness must be introduced. In order to increase efficiency and robustness in the delivery of exam files, we will study the use of fountain codes and UPC codes . According to , a fountain codifier is a metaphoric well which produces an infinite quantity of drops of water (packages of codified data). Thus, anyone who wishes to receive a coded file puts a bucket under the well and collects drops until the number of drops in the bucket is sufficient to recover the original file and decode the packages. In the analogy of the CoDPON system, the well would be the checkpoints, and the drops (packages) would be transported by the boats up to the destination (the state capital), which would have a bucket to collect them. If one assumes that the information one wishes to be transferred is a “bucketful of water,” one needs only to generate several drops and feed the bucket (which will be collected at the destination) at the checkpoints, until they are full of original information. The great contribution of fountain codes is that they can retrieve files, even without all the original packages, or it is possible to rebuild a lost package using copies left over from packages already received.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
This research is partly supported by NSF Grants CCF-1116368 and CCF-1353089 (USA) and FIDESA (in Brazil).
- R. C. Shah, S. Roy, S. Jain, and W. Brunette, “Data MULEs: modeling and analysis of a three-tier architecture for sparse sensor networks,” Ad Hoc Networks, vol. 1, no. 2-3, pp. 215–233, 2003.
- RFC 4838, “Delay-Tolerant Networking Architecture,” 2007, http://tools.ietf.org/html/rfc4838.
- “Map of Marajó Archipelago,” 2014, https://www.google.com.br/maps/place/Arquip%C3%A9lago+do+Maraj%C3%B3%20,+%20PA/@-0.9950443,-50.0457297,9z/data=!4m2!3m1!1s0x9298b193c0b8372d:0x5aba6a2a87297515%3E.09/01/2014.
- IBGE, Censo 2010, http://www.censo2010.ibge.gov.br/.
- M. M. Coutinho, T. Moreira, E. Silva, A. Efrat, and T. Johnson, “Work in progress: a new proposal of data mule network focused on Amazon riverine population,” in Proceedings of the 3rd Extreme Conference on Communication: The Amazon Expedition (ExtremeCom '11), ACM, September 2011.
- L. Sundararaj and P. Vellaiyan, “An overview of Alagappa University delay tolerant water monitoring network,” International Journal of Computer Science and Network Security, vol. 10, no. 5, p. 19, 2010.
- G. Anastasi, M. Conti, and M. D. Francesco, “Data collection in sensor networks with data mules: an integrated simulation analysis,” in Proceedings of the 13th IEEE Symposium on Computers and Communications (ISCC '08), pp. 1096–1102, IEEE, July 2008.
- A. Keränen, J. Ott, and T. Kärkkäinen, “The ONE simulator for DTN protocol evaluation,” in Proceedings of the 2nd International Conference on Simulation Tools and Techniques (Simutools '09), Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, 2009.
- A. Pentland, R. Fletcher, and A. Hasson, “Daknet: rethinking connectivity in developing nations,” Computer, vol. 37, no. 1, pp. 78–83, 2004.
- S. Naidu, S. Chintada, M. Sen, and S. Raghavan, “Challenges in deploying a delay tolerant network,” in Proceedings of the 3rd ACM workshop on Challenged networks (CHANTS '08), pp. 65–71, ACM, September 2008.
- L. Viet-Duc, H. Scholten, and P. Havinga, “Evaluation of opportunistic routing algorithms on opportunistic mobile sensor networks with infrastructure assistance,” International Journal on Advances in Networks and Services, vol. 5, no. 3-4, pp. 279–290, 2012.
- I. Christian, C. H. W. Oey, and S. Moh, “A simple temporal node mobility model for performance analysis in delay tolerant networks,” Journal of Communications and Information Sciences, vol. 3, no. 3, pp. 200–206, 2013.
- Q. Wang and Z. J. Haas, “Analytical model of epidemic routing for delay-tolerant networks,” in Proceedings of the 1st ACM Workshop on High Performance Mobile Opportunistic Systems, pp. 1–8, October 2012.
- O. Khalid, S. U. Khan, J. Kolodziej et al., “A checkpoint based message forwarding approach for opportunistic communication,” in Proceedings of the 26th European Conference on Modelling and Simulation, (ECMS '12), June 2012.
- A. C. Smith, M. Bensink, N. Armfield, J. Stillman, and L. Caffery, “Telemedicine and rural health care applications,” Journal of Postgraduate Medicine, vol. 51, no. 4, pp. 286–293, 2005.
- P. S. Pandian, K. P. Safeer, D. T. I. Shakunthala, P. Gopal, and V. C. Padaki, “Store and forward applications in telemedicine for wireless IP based networks,” Journal of Networks, vol. 2, no. 6, pp. 58–65, 2007.
- P. Corr, I. Couper, S. J. Beningfield, and M. Mars, “A simple telemedicine system using a digital camera,” Journal of Telemedicine and Telecare, vol. 6, no. 4, pp. 233–236, 2000.
- Z.-P. Ho and C.-S. Wu, “Application of simulated annealing algorithm to optimization deployment of mobile wireless base stations,” Advances in Intelligent and Soft Computing, vol. 169, no. 2, pp. 665–670, 2012.
- A. Kalyanpur, V. P. Neklesa, D. T. Pham, H. P. Forman, S. T. Stein, and J. A. Brink, “Implementation of an international teleradiology staffing model,” Radiology, vol. 232, no. 2, pp. 415–419, 2004.
- “IDESP (Institute of Economic, Social and Environmental Development of Pará),” http://www.idesp.pa.gov.br/.
- “The Network Simulator ns-2,” 2012, http://www.isi.edu/nsnam/ns.
- L. Begg, F. Y. Chan, G. Edie, R. Hockey, and R. Wootton, “Minimum acceptable standards for digital compression of a fetal ultrasound video-clip,” Journal of Telemedicine and Telecare, vol. 7, supplement 2, pp. 88–90, 2001.
- T. Spyropoulos, K. Psounis, and C. S. Raghavendra, “Spray and wait: an efficient routing scheme for intermittently connected mobile networks,” in Proceedings of the ACM SIGCOMM Workshop on Delay-Tolerant Networking (WDTN '05), pp. 252–259, ACM, August 2005.
- M. Ababou, R. Elkouch, M. Bellafkih, and N. Ababou, “New strategy to optimize the performance of epidemic routing protocol,” International Journal of Computer Applications, vol. 92, no. 7, pp. 27–33, 2014.
- N. Rahnavard, B. N. Vellambi, and F. Fekri, “Rateless codes with unequal error protection property,” IEEE Transactions on Information Theory, vol. 53, no. 4, pp. 1521–1532, 2007.
- D. J. C. MacKay, “Fountain codes,” IEE Proceedings-Communications, vol. 152, no. 6, pp. 1062–1068, 2005.
Copyright © 2014 Mauro Margalho Coutinho et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.