An efficient solution is proposed in this article to determine the best reliable route and to prolong the lifetime of the mobile Ad-hoc networks (MANETs). In the proposed solution, the route discovery process of the Ad-hoc on-demand distance vector routing protocol (AODV) has been modified using a novel delayed rebroadcast scheme. It combines the shortest route selection criterion of AODV with the real network status including the wireless link quality, the remaining power capacity, as well as the traffic load at each node. Simulation results show that the proposed scheme can significantly extend the network lifetime and provide fewer packet losses than the conventional AODV protocol.
Development of fair and efficient bandwidth allocation and admission control schemes is one of the key issues in the design of IEEE 802.16 broadband wireless access systems in time division multiple access (TDMA) mode. In this article,the problem of bandwidth allocation and admission control is formulated as a Nash bargaining model. The nash bargaining solution (NBS) derived from the cooperative game is adopted to maximize the spectrum utilization. Analysis and simulation results show that there is a unique Pareto optimal bandwidth allocation solution by using NBS among various flows. Furthermore,maximum utility of the system can also be maintained by using the admission control policy with different number of connections and variable channel qualities. The total throughput of the proposed scheme is close to the maximal one,while significantly improving fairness compared to the existing solutions.
CAI Dao-jin ,JI Hong,LI Xi Key Laboratory of Universal Wireless Communications,Ministry of Education,Beijing University of Posts and Telecommunications,Beijing 100876,China
IIn order to improve the performance of wireless distributed peer-to-peer(P2P)files sharing systems,a general system architecture and a novel peer selecting model based on fuzzy cognitive maps(FCM)are proposed in this paper.The new model provides an effective approach on choosing an optimal peer from several resource discovering results for the best file transfer.Compared with the traditional min-hops scheme that uses hops as the only selecting criterion,the proposed model uses FCM to investigate the complex relationships among various relative factors in wireless environments and gives an overall evaluation score on the candidate.It also has strong scalability for being independent of specified P2P resource discovering protocols.Furthermore,a complete implementation is explained in concrete modules.The simulation results show that the proposed model is effective and feasible compared with min-hops scheme,with the success transfer rate increased by at least 20% and transfer time improved as high as 34%.
A novel topology scheme, cell with multiple mobile sinks method (CMMSM), is proposed in this article for the collection of information and for the environment monitoring in wireless sensor networks. The system consists of many static sensors, scattered in a large scale sensing field and multiple mobile sinks, cruising among the clusters. Conservation of energy and simplification of protocol are important design considerations in this scheme. The noninterference topology scheme largely simplifies the full-distributed communication protocol with the ability of collision avoidance and random routing. The total number of cluster heads in such a topology was analyzed, and then an approximate evaluation of the total energy consumption in one round was carried out. Simulation results show that CMMSM can save considerable energy and obtain higher throughput than low-energy adaptive clustering hierarchy (LEACH) and geographical adaptive fidelity (GAF).
提出了一种适用于无线传感器网络的基于多个移动代理的能量高效信息收集方案(Cell with Multiple Mobile Sinks Method,CMMSM)。通过一种基于分簇的无干扰拓扑分布设计,配合移动代理的使用,大大降低了MAC和路由协议的设计复杂程度。仿真结果证明了新方案的能量高效性,和满足不同时延要求的应用可扩展性。
