- Research Article
- Open Access
Relay Ability Estimation and Topology Control Using Multidimensional Context Parameters for Mobile P2P Multicast
© Hiroyuki Kubo et al. 2011
- Received: 1 May 2010
- Accepted: 21 October 2010
- Published: 24 October 2010
We focus on mobile P2P multicast, in which mobile end nodes not only act as receivers but also relay the received stream forward to others. In mobile P2P multicast, negative effects caused by the change of available bandwidth and the disconnection of mobile nodes are propagated to the downstream nodes. To solve this problem, we developed a novel node-allocation framework using the multidimensional context parameters of each mobile node, which include available bandwidth, disconnection rate, and the remaining battery capacity. Considering the significance of each parameter, our method integrates these parameters into a single parameter called relay ability. Taking the relay ability into account, each node is allocated to the multicast topology to minimize the negative effects mentioned above. To test our method, we applied our framework to conventional P2P multicast topology and show the results from comparative evaluations through computer simulation.
- Mobile Node
- Mobile Network
- Multicast Tree
- Battery Capacity
- Multiple Description Code
The demand for large-scale live streaming services, in which live content is simultaneously distributed to a large number of users, has been increasing. Enhancements to transmission speed and mobile-node capability in wireless access networks enable people to use such services via their personal mobile devices. While those services are still provided using server-client type techniques in mobile networks, they have been shifting to peer-to-peer-(P2P-) based technology in wired networks [1–3]. P2P multicast is a method of sending a stream over the application layer, in which end nodes not only act as receivers but also relay the received stream forward to others. This peer-to-peer solution enables us to quickly and easily deploy multicast applications without any improved routers. However, P2P multicast has rarely been applied to mobile networks because the transmission speed remains much slower than that in fixed wired networks. Even when many mobile nodes simultaneously request the same content, one centralized server can handle the requests, because the required bit rate for each mobile node is not high in conventional mobile networks. However, in the next five to ten years, mobile users will require higher bit rates as wireless access networks continue to increase transmission speed to a few Mbps. This will require P2P multicast for mobile networks to handle the large numbers of requests from mobile nodes.
However, of course, there remain several problems we need to solve to apply P2P multicast to mobile networks. First, the available bandwidth of a node in mobile networks is instable; it is determined mainly by the radio signal strength of the node, which dynamically changes depending on the position and the movement of the node. Second, disconnections of nodes occur easily when they get out of the wireless coverage range or when their batteries run out . In P2P multicast, the negative effects caused by disconnection and changes in available bandwidth are propagated to the nodes that receive the forwarded stream . Therefore, one key effort is how to locate better nodes as close to the content source as possible to suppress the negative impact on the whole P2P network. Previous efforts, including our previous work, have discussed how to locate nodes on a P2P multicast topology on the basis of only single-context parameters [6–9]. However, a single-context parameter is not enough to appropriately locate nodes in the topology; in mobile networks, we would need to consider at least three context parameters: available bandwidth, movement, and remaining battery capacity, which can be observed by the mobile devices. However, we cannot easily determine which node is better because the above parameters are multidimensional; for example, what is better for a network: a node with wide available bandwidth or with large remaining battery capacity?
To address this, we developed a novel node-allocation framework using the multidimensional context parameters of mobile nodes for mobile P2P multicast topology. First, to deal with multidimensional parameters, our method analyzes the statistical relationship between each context parameter of a node and the service quality experienced by the analysis. To assess how significantly each context parameter affects the experienced service quality, we introduce two metrics: the number of received bits, which is how many bits a node has received within a period, and receiving time, which is how long a node has been able to decode the video stream. Second, considering the significance of each parameter, our method integrates these parameters into a single parameter called relay ability. Taking the relay ability into account, each node is allocated to the P2P multicast topology to minimize negative effects caused by the dynamic change of available bandwidth and frequent disconnection. Finally, to test our method, we applied our framework to P2P multicast topology, and we show the results of comparative evaluations through computer simulation.
2.1. Overlay Topology Construction for P2P Multicast
One of the major issues in P2P multicast is how to construct overlay topologies. Tree-based topology construction is popular because it is simple and because it enables load balancing among nodes [1, 6]. However, in tree topologies, a stream is forwarded from parents to their children in a hop-by-hop manner; the stream is easily terminated and downstream nodes cannot receive it when an upstream node is disconnected. Therefore, to improve robustness, a multitree multicast has been proposed in , while mTreebone  is a hybrid tree/mesh design.
Moreover, there have been several studies on overlay multicast structures that take mobile terminals into consideration. An overlay multicast architecture that locates instable mobile nodes to the outskirts of the multicast tree can reduce the effect of bandwidth instability on overlay multicast . However, when the majority of nodes in an overlay network are mobile, which we assume in this paper, it would be hard to apply this method to the network.
2.2. Statistical Analysis in Conventional Research
As mentioned in Section 1, our method uses statistical analysis for dynamic P2P topology control. To the best of our knowledge, statistical analysis has been conventionally used only for static network analysis and design, not for dynamic control. We introduce several conventional studies below.
The work in  measures radio channels and analyzes general channel characteristics using statistical analysis. The work in  takes a statistical analysis approach to optimal design in mobile satellite broadcast systems. The proposed scheme in  performs QoS mapping between the application level and the user level by multiple regression analysis, which is a statistical analysis method. The work in  analyzes the characteristics of the multicast tree for many-to-many communications through multiple regression analysis. The study found that the index that most affects the performance of the tree depends on the number of multicast members.
3.1. System Model
In our method, the system server has a database for storing context parameters observed in every node and can estimate their relay abilities. In this paper, we assume nodes ideally observe their own context parameters and inform the system server of them via background control paths, and we consider control traffic negligible compared to the stream rate, that is, a few Mbps.
3.2. Integration of Multidimensional Context Parameters to Relay Ability
This means that multiple context parameters of node are integrated into the relay ability of node using appropriate weights . The next question is how to determine . Our key idea is to address the significance of weight by determining how parameter affects the experienced service quality. Multiple linear regression analysis (MLRA) , which is a multivariate analysis method, derives as follows.
The system server constructs the P2P multicast topology based on the estimated relay abilities of the nodes.
After a certain service interval (topology update interval), for every , node observes its actual relay ability and multiple context parameters , and updates parameter set to the statistical database, and then it returns to Step 2).
In general, the computational complexity of MLRA is when the numbers of nodes and context parameters are and . Since is at most 10 and there is no exponential relation between and , this should not be a problem.
3.3. Topology Construction Using Relay Ability
Rate per description
Max. received quality
New-node join interval
Max. battery capacity
No. of branches of tree
No. of mesh links
No. of trials
Battery consumption ratio,
Ratio of stable nodes
4.1. Proposed and Compared Methods
We call our method using this definition MLRA-RD (Relaying time Duration). This method increases the time during which nodes can continuously receive at least the minimum number of received bits, because it locates frequently disconnected nodes downstream. Note that, available bandwidth is commonly used as the initial relay ability. That is because at the beginning, users have not started moving and batteries have not been consumed.
We compare our methods with the three following methods.
BW: available bandwidth is used as the only context parameter.
MULTIPLY: is used as the relay ability. Multiplying is one of the simplest ways to integrate multiple context parameters, because we do not need to be careful of scale and dimensional difference between parameters. This method uses available bandwidth as the initial value of relay ability as our methods do.
RANDOM: nodes are located in the topology at random. The RANDOM method is a good benchmark of the lower-bound performance.
Simulation parameters in wireless-channel modeling.
Node moving range
1 [m] (stable)/
(interval of waypoint)
20 [m] (unstable)
Upper Bound 
(standard dev.) = 5 [dB]
4.3. Energy Consumption
Performance versus in mTreebone with varying . Other parameters are listed in Table 1.
4.4. User Behavior
In each simulation trial, the initial number of nodes is . Then, at a regular interval shown in Table 1, a new node joins the network. In general, nodes with less remaining battery capacity try to reduce their forwarding data rate to other nodes. Therefore, we assumed that, although nodes accept forwarding at double their receiving data rate, they reduce it to the same rate as their receiving data rate when their remaining battery capacities fall below half the maximum. Nodes leave the service when their batteries run out.
4.5. P2P Multicast Topologies
As we mentioned in Section 3.3, we can use conventional topologies in our framework. We used tree and mTreebone in our simulations. We include the topology parameters in Table 1. mTreebone has both tree and mesh parts in its topology. To capture the effect of node allocation clearly, we simply set the ratio of tree nodes to 0.5. We set the number of assigned links for every mesh node to 3. As the number increases, the route diversity effect increases but the complexity of session handling and video decoding becomes more complicated. We assume that considering the maximum stream quality, each node should equip a few Mbytes of received buffer. In this assumption, the time difference between received streams from different routes does not cause any problems.
Considering the system overhead, we should not make the topology update interval too small, while it would be hard to track the changing speed of wireless channels if we set it too long. In this simulation, we varied the topology update interval from 10 to 50 s.
4.6. Evaluated Metrics
where and represent the transmission rate and remaining battery capacity of node , respectively. This metric indicates the system stability, because (7) is the ratio of the time during which nodes can receive data to the time during which nodes can connect to the network.
In the above metrics, the received bit rate is considered to be continuously changing. However, it is more realistic that, in streaming services, the bit rate changes discretely. Therefore, we assume the forwarded bit rate decreases or increases by 0.2 Mbps, and 4.0 Mbps corresponds to the highest quality. Furthermore, in mTreebone, mesh nodes can receive streams from two or more parent nodes. Therefore, we assumed that multiple description coding (MDC) technology [20, 21] allows us to ideally combine the multiple streams.
5.1. Simulation Result in Tree Topology
Figure 3(b) shows the receiving ratio, defined in Section 4.6, versus the topology update interval. Our method maintain the performances superior to the other methods. In addition, unlike in Figure 3(a), MLRA-RD is better than MLRA-AR here. This is because MLRA-RD considers "forwarding time duration" to be relay ability and locates nodes with long forwarding time upstream, which increases the receiving time. This implies that we can control the objective of the network topology by changing how we define relay ability. However, MLRA-RD keeps its superiority to MLRA-AR in shorter topology update intervals. This means the accurate number of forwarded bits is estimated more easily than the forwarding time duration.
Figure 3(c) shows the total number of received bits divided by the total consumed energy versus the topology update interval. This is an energy efficiency metric. Moreover, the characteristics in Figure 3(c) are similar to Figure 3(a) because there was little difference in the total consumed energy between different methods here. The result showed that the energy efficiency of our methods is superior to other methods.
Another thing we can learn from Figure 3 is that, as the topology update interval decreases, basically, the performance gradually decreases. The reason BW is the most sensitive to topology update interval is that, within a topology update interval, nodes with large bandwidth were allocated upstream in this method. Because there is no consideration of their remaining battery capacities, these upstream nodes leave the network if their battery capacity runs out in BW.
5.2. Simulation Result in mTreebone
5.2.1. Performance versus Topology Update Interval in mTreebone
We also observe how total number of received bits and receiving ratio performance depend on the ratio of battery consumption of receiving to forwarding , which was defined in Section 4.3. We summarize the results of our methods and the MULTIPLY method, which gave the best performances among the compared methods in Figure 4, as seen in Table 3. As the table shows, our methods are better than MULTIPLY for various values of .
5.2.2. Performance versus Node Stability in mTreebone
5.2.3. Performance versus Number of Initial Nodes in mTreebone
5.2.4. Individual Service Quality
In Figure 7, MLRA-AR is the fairest of the four methods because, if the remaining battery capacity of an upstream node has been reduced because of forwarding, MLRA-AR immediately relocates the node downstream before the battery is fully consumed. However, the receiving time for users in MLRA-RD is longer than that in MLRA-AR.
We used MLRA, which is a basic multivariate analysis method, to integrate multiple context parameters into relay ability. Of course, it is possible to use other multivariate analysis methods. It can be meaningful to compare MLRA with other multivariate analysis methods. Although it should be included in our future work, we would like to introduce several alternative methods.
A Bayesian network is a probabilistic graphical model that represents a set of random variables and their conditional independences . A Bayesian network first builds a directional graph in which initial multiple parameters are integrated into a smaller number of new parameters. Then, it produces a conditional probability table that represents the transit probability from an initial parameter to a new parameter. Repeating this, lastly, this probabilistic graph enables us to estimate the correlation between the initial parameters and the final integrated parameters, like relay ability in our study.
Conjoint analysis  was originally used for marketing, but it is now also used to analyze user preference. A user's set of overall responses to factorial designed stimuli can be decomposed so that the utility of each stimulus attribute can be inferred from the user's overall evaluation of the stimuli.
We developed a novel node-allocation framework that uses multidimensional context parameters of mobile nodes for mobile P2P multicast. We introduced a statistical analysis MLRA to integrate multidimensional context parameters into a single parameter that represents relay ability. Relay ability is used to allocate nodes at appropriate positions in the P2P multicast topology. To test our framework, we compared it to several other methods through simulation of total throughput, stability, and energy efficiency. The simulation results showed that our framework works better than the other methods and can change the definition of the relay ability depending on the objective, including total throughput, stability, and fairness. For future work, we will evaluate alternative multivariate analysis methods in our framework. Also, there remain several common issues in the research field of P2P applications: selfish user behaviors  and high-churn networks , in which users leave and join very frequently.
- Liu J, Rao SG, Li B, Zhang H: Opportunities and challenges of peer-to-peer internet video broadcast. Proceedings of the IEEE 2008, 96(1):11-24.View ArticleGoogle Scholar
- PPStream homepage, http://www.ppstream.com/
- PPLive homepage, http://www.pptv.com/
- Wolfson O, Xu B, Tanner RM: Mobile peer-to-peer data dissemination with resource constraints. Proceedings of the IEEE International Conference on Mobile Data Management (MDM '07), 2007, Mannheim, Germany 1-15.Google Scholar
- Guo H, Lo K-T, Qian Y, Li J: Peer-to-peer live video distribution under heterogeneous bandwidth constraints. IEEE Transactions on Parallel and Distributed Systems 2009, 20(2):233-245.View ArticleGoogle Scholar
- Wang F, Xiong Y, Liu J: MTreebone: a hybrid tree/mesh overlay for application-layer live video multicast. Proceedings of the 27th International Conference on Distributed Computing Systems (ICDCS '07), June 2007, Toronto, ON, Canada 49.View ArticleGoogle Scholar
- Noguchi T, Yamamoto M: Robust application-level multicast tree construction for wireless/mobile hosts. Proceedings of the 4th International Conference on Wired/Wireless Internet Communications, 2006, Bern, Switzerland, Lecture Notes in Computer Science 3970: 108-119.Google Scholar
- Venkataraman V, Yoshida K, Francis P: Chunkyspread: multi-tree unstructured peer-to-peer multicast. Proceedings of the 5th Fifth International Workshop on Peer-to-Peer Systems, 2006Google Scholar
- Yoshino M, Kubo H, Shinkuma R, Takahashi T: Modeling user cooperation problem in mobile overlay multicast as a multi-agent system. Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM '09), 2009, Honolulu, Hawaii, USAGoogle Scholar
- Riback M, Asplund H, Medbo J, Berg J-E: Statistical analysis of measured radio channels for future generation mobile communication systems. Proceedings of the IEEE Vehicular Technology Conference (VTC '05), 2005, Stockholm, Sweden 61(1):68-72.Google Scholar
- Martin C, Geurtz A, Ottersten B: Statistical analysis and optimal design for efficient mobile satellite broadcast with diversity. IEEE Transactions on Vehicular Technology 2008, 57(2):986-1000.View ArticleGoogle Scholar
- Tasaka S, Watanabe Y: Real-time estimation of user-level QoS in audio-video IP transmission by using temporal and spatial quality. Proceedings of the 50th Annual IEEE Global Telecommunications Conference (GLOBECOM '07), November 2007, Washington, DC, USA 2661-2666.Google Scholar
- Karasawa H, Terada S, Miyoshi T, Yamori K, Tanaka Y: Evaluation indices of many-to-many multicast routing tree to represent delay performance. Proceedings of 9th Asia-Pacific Conference on Communications (APCC '03), 2006, Busan, Republic of KoreaGoogle Scholar
- Hei X, Liu Y, Ross KW: Inferring network-wide quality in P2P live streaming systems. IEEE Journal on Selected Areas in Communications 2007, 25(9):1640-1654.View ArticleGoogle Scholar
- Montgomery DC, Peck EA, Vining GG: Introduction to Linear Regression Analysis. John Wiley & Sons, New York, NY, USA; 1982.MATHGoogle Scholar
- Nocetti FG, Stojmenovic I, Zhang J: Addressing and routing in hexagonal networks with applications for tracking mobile users and connection rerouting in cellular networks. IEEE Transactions on Parallel and Distributed Systems 2002, 13(9):963-971. 10.1109/TPDS.2002.1036069View ArticleGoogle Scholar
- IEEE802.11a : High speed physical layer (PHY) in 5 GHz band. 1999Google Scholar
- Lee K, Hong S, Kim SJ, Rhee I, Chong S: SLAW: a mobility model for human walks. Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '09), 2009, Rio de Janeiro, Brazil 855-863.Google Scholar
- Rec. ITU-R P.1411-2 pp. 6-7, 1999Google Scholar
- Goyal VK: Multiple description coding: compression meets the network. IEEE Signal Processing Magazine 2001, 18(5):74-93. 10.1109/79.952806View ArticleGoogle Scholar
- Guo H, Lo K-T: Cooperative media data streaming with scalable video coding. IEEE Transactions on Knowledge and Data Engineering 2008, 20(9):1273-1281.View ArticleGoogle Scholar
- Korpipää P, Mäntyjärvi J, Kela J, Keränen H, Malm E-J: Managing context information in mobile devices. IEEE Pervasive Computing 2003, 2(3):42-51. 10.1109/MPRV.2003.1228526View ArticleGoogle Scholar
- Pagani M: Determinants of adoption of third generation mobile multimedia services. Journal of Interactive Marketing 2004, 18(3):46-59. 10.1002/dir.20011View ArticleGoogle Scholar
- Mol JJD, Pouwelse JA, Meulpolder M, Epema DHJ, Sips HJ: Give-to-get: free-riding-resilient video-on-demand in P2P systems. Proceedings of the Multimedia Computing and Networking Conference (MMCN '08), 2008, Proceedings of SPIE 6818, article no. 681804:Google Scholar
- Zöls S, Schollmeier R, Kellerer W, Tarlano A: The hybrid chord protocol: a peer-to-peer lookup service for context-aware mobile applications. Proceedings of the 4th International Conference on Networking, 2005, Reunion Island, France, Lecture Notes in Computer ScienceGoogle Scholar
This article is published under license to BioMed Central Ltd. 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.