Multi-Cast Performance And Packet Loss Analysis In Heterogeneous Ad-Hoc Networks

The performance analysis and multicast mechanisms have been one of the hottest research topic after the wireless Ad-Hoc networks were emerged.In the existing work,researchers focused on the assumption that the nodes in network belong to one type and their movement is based on the i.i.d.mobility model.However,there are plenty of nodes in the real world networks and they have different distributions and mobility patterns,as well as different communication ability and transmission bandwidth,which leads to the change on network topology and link stability.In a word,they are actually heterogeneous networks with different topology and performance.Thus,it is necessary for researchers to study further into the heterogeneous ad-hoc networks to understand their inner characters.This paper studies the important performance characters in heterogeneous ad-hoc networks,including network performance analysis under correlated mobility model,the packet loss of existing network multi-cast methods and the reliable packet repair scheme.In this paper we study the performance and packet repair ability in heterogeneous ad-hoc networks.First we introduce the idea and concept of heterogeneous ad-hoc networks and their performance characters as well as the definition of packet loss.Then we analyses the node mobility model,communication model and the transmission cooperation between nodes.After that we study the capacity and delay tradeoff when nodes are moving according to uncorrelated mobility model.Despite the assumption that all source nodes and receiver nodes are following i.i.d.distribution and i.i.d.mobility model,our work is based on the cooperative transmission framework which makes static nodes as source and destination nodes and mobile nodes as relay nodes.Simulation results show that it achieves higher throughput and less latency than i.i.d.mobility model.Then we study the two-hop and miltihop packet repair mechanism and propose a reliable MotionCast protocol in wireless networks.We prove that the existing MotionCast solutions suffer from the low throughput incurred by the packet loss.For example,we show that the lower bound of packet loss rate under the existing multi-hop relay selection algorithm is 5:23% and it is even worse under the two hop relay algorithm.Thus it is important to find a high efficiency method to realize packet repair in MotionCast.This paper presents a reliable MotionCast protocol in wireless networks.The impact of packet loss on the MotionCast throughput is minimized while the traffic footprints and repair latency are improved.Simulation results show that RMP achieves higher throughput,lower traffic footprint and less repair latency than other representative MotionCast algorithms.Our solution can be easily applied to communication applications such as D2 D and heterogeneous sensor network.