Towards efficient device-to-device multicast content delivery with social awareness

Frequent content retrieval leads to significant energy consumption in cellular networks. Thereby, device-to-device (D2D) communication is used for proximal content delivery. Be aware that social friends may have common content interests, D2D content delivery is further improved by considering social network. However, how to implement efficient D2D multicast with the aid of social relationship needs further consideration. In this paper, with a proposed architecture on combined networks, the cooperation range of content sharing is investigated for D2D multicast to minimize the average energy consumption of serving a content request. Based on combined networks, a cooperation group formation scheme is proposed. Simulation results verify our analyzes and the advantage of proposed scheme.     

应急情况下最少转发节点的传感器网络组播路由树算法

在抢险救灾等应急情况下,传感器网络的节点能量更为有限。为减少无用转发的能量消耗,利用无线信道的广播特性,根据广播子树删除思想,提出一种基于最短路由树、具有最少转发节点的组播路由树生成算法。对该算法进了证明和详细分析,并针对实际需要,给出使用范围更广泛的分布式实现方法。仿真分析说明,算法的分布式实现方法可减少ODMRP的转发节点数,大大降低数据发送次数,接收成员节点较多时尤为明显。最少转发节点的组播路由树的网络总开销最小,是延长网络生存时间的有效方法。     

A weight-aware channel assignment algorithm for mobile multicast in wireless mesh networks

Wireless mesh networks (WMNs) are one of key technologies for next generation wireless networks. In this paper, we propose a heuristic channel assignment algorithm with weight awareness to support mobile multicast in WMNs. To enhance network throughput, our algorithm is based on the path forwarding weight to perform channel assignment. In addition to non-overlapping channels, partially-overlapping channels are also used in channel assignment. To fully exploit all available channels in channel assignment, we devise a new channel selection metric to consider the channel separation and the distance between nodes. In mobile multicast, the multicast tree structure cannot be fixed due to receiver (multicast member) mobility. The change of the multicast tree structure will result in channel re-assignment. The proposed algorithm is based on a critical-event driven manner to reduce the times of channel re-assignment as much as possible. Finally, we perform simulation experiments to show the effectiveness of the proposed channel assignment algorithm.     

Multi-Rate Polling: Improve the Performance of Energy Harvesting Backscatter Wireless Networks

In recent years, Researchers have proposed the concept of Energy Harvesting Backscatter Wireless Networks (EHBWN). EHBWN usually consists of one sink and several backscatter nodes. Backscatter nodes harvest energy from their environment and communicate with sink through backscattering the carrier wave transmitted by sink. Although a certain amount of access protocols for Energy Harvesting Wireless Networks have been present, they usually do not take the sink’s receiver sensitivity into account, which makes those protocols unsuitable in practice. In this paper, we first give an analysis of the backscatter channel link budget and the relationship between the effective communication range and uplink data rate. After that, we point out that a single uplink data rate for all the backscatter nodes is no longer suitable due to the constraint of sink receiver sensitivity. Later we propose Multi-rate Polling which divides the network into different uplink data rata regions to make sure the correct packet reception by the sink and improve the network performance. Multi-rate Polling also introduces a parameter K, through adjusting it, we can achieve the trade-off between network throughput and fairness to meet the requirement under various scenarios. We validate Multi-rate Polling under different networks and average harvesting rates through simulation. The result shows that the proposed protocol can effectively improve the network performance and has excellent scalability, which makes it suitable for EHBWN.     

Impact of device unavailability on the reliability of multicast transport in IEEE 802.11 networks

Multicast transport is an efficient solution to deliver the same content simultaneously to many receivers. This transport mode is mainly used these days to deliver real-time video streams. However, multicast transmissions support over IEEE 802.11 networks does not provide any feedback policies, which implies a definite loss of missing packets. This impacts the reliability of the multicast transport and the application employing it. An alternative to improve the reliability of multicast streaming over 802.11 networks is to prevent packet losses. In this perspective, it is necessary to identify the loss causes and to perform the required prevention actions. It is well known that collisions and path loss are two fundamental sources of transmission failures. Their impact can be eliminated by means of collision prevention and data rate adaptation. However, several works show that the loss rate of multicast packets may be considerable even in collisions-free environments and using an appropriate transmission rate. Particularly they show that losses may have a bursty nature which does not correspond to the bit error rate model of the PHY layer as defined by the chipset manufacturers. Therefore, in this paper, we carry out a thorough investigation of the loss causes in wireless networks. We show that device unavailability may be the principal cause of the significant packet losses that occur and their bursty nature. Particularly, our results show that the CPU overload may incur a loss rate of 100%, and that the delivery ratio may be limited to 35% when the device is in the power save mode.     

Providing reliable and link stability‐based geocasting model in underwater environment

This paper presents a geocast technique for underwater sensor networks. The model named as Routing and Multicast Tree based Geocasting (RMTG) (TRACE'10, Bhopal, India, 2010; ICWET'10, Mumbai, India, 2010) has been designed for underwater sensor networks. In our previous work (TRACE'10, Bhopal, India, 2010; ICWET'10, Mumbai, India, 2010) we proposed only a theoretical model for underwater geocasting. The RMTG technique uses greedy forwarding and previous hop handshaking to route the packets towards the geocast region and further disseminates the data within the geocast region by creating a multicast shortest path tree. We also presented various link broken scenarios along with their solutions. The proposed model does not use the flooding technique to deliver the packets inside the geocast region that is used in most of the geocasting techniques. In this paper, we present the simulated RMTG model. The simulation results show that the proposed model provides an efficient distribution of data in the geocast region in terms of node mobility handling, packet delivery ratio and a better end‐to‐end latency. Most of the work on geocasting has been done for mobile and vehicular ad hoc networks; hence we present in this paper a novel simulated model for underwater environment. Copyright © 2011 John Wiley & Sons, Ltd.     

一种新的分层多播拥塞控制协议

提出了一种新的自适应分层多播拥塞控制方案(ALM)。ALM是发送方与接收方共同驱动、由路由器辅助流量控制的拥塞控制方案,通过把发送方的动态分层和接收方的自适应速率调整有机结合,不仅增强了分层多播的适应能力,提高了系统的吞吐量,而且较好地满足了TCP友好性。仿真实验表明,ALM能有效地利用网络带宽,解决网络带宽的异构性问题,并能通过接收端计算TCP友好速率,使接收端达到与TCP流公平竞争网络资源的目的。     

光网络中基于组播树的静态业务疏导算法

为了减少波分复用(WDM)网络中波长资源消耗,将组播路由算法的思想运用于静态业务疏导的计算,通过建立业务疏导树来实现静态业务疏导.为了减少疏导树的数量,从而减少网络中波长资源的消耗,将节点间的业务请求分组归并,利用装包算法使业务分组的数量最少,并通过构建最小生成树实现传输路径共享.仿真结果表明,本文的算法可以有效地减少...     

一种支持扇出分割能力的光组播调度算法研究

组播调度是影响光组播分组交换节点吞吐量的重要因素.针对“一次发送”模型下的光组播调度算法对阻塞的源组播实行全部丢弃的缺点,文章基于节点共享有限波长转换器的光分组交换结构,提出了一种支持扇出分割能力的光组播调度算法,该算法采用随机丢弃阻塞的源组播复制的方法,有效地提高了端口资源的利用率.仿真结果表明,该算法与已有算法相比...     

一种改进的时延受限低代价光组播路由算法

针对光网络时延受限光组播路由计算复杂度高的问题,提出一种基于改进的和声搜索求解时延受限光组播路由的算法。论文通过引入自适应的和声记忆保留率及微调概率提高和声算法搜寻到全局最优光组播树的能力;算法设计了一个能够保持备选光组播树多样性的动态适应度函数以扩大光组播路由的搜索范围;同时,算法在初始化和声库时采用精英保留策略简化和声迭代过程。仿真结果表明,提出的改进算法能够求得代价更低的光组播路由,且算法在较大光网络规模下具有较好的收敛稳定性。