A dynamic protocol stack(DPS) for ad hoc networks, together with a protocol stack construction scheme that is modeled as a multiconstrained knapsack problem is proposed. Compared to the traditional static protocol sta...A dynamic protocol stack(DPS) for ad hoc networks, together with a protocol stack construction scheme that is modeled as a multiconstrained knapsack problem is proposed. Compared to the traditional static protocol stack, DPS operates in a dynamic and adaptive manner and is scalable to network condition changes. In addition, a protocol construction algorithm is proposed to dynamically construct of the protocol stack each network node. Simulation results show that, the processing and forwarding performance of our scheme is close to 1 Gb/s, and the performance of our algorithm is close to that of the classical algorithms with much lower complexity.展开更多
Mobile ad hoc networks (MANETs) have become a hot issue in the area of wireless networks for their non-infrastructure and mobile features. In this paper, a MANET is modeled so that the length of each link in the net...Mobile ad hoc networks (MANETs) have become a hot issue in the area of wireless networks for their non-infrastructure and mobile features. In this paper, a MANET is modeled so that the length of each link in the network is considered as a birthdeath process and the space is reused for n times in the flooding process, which is named as an n-spatiai reuse birth-death model (n-SRBDM). We analyze the performance of the network under the dynamic source routing protocol (DSR) which is a famous reactive routing protocol. Some performance parameters of the route discovery are studied such as the probability distribution and the expectation of the flooding distance, the probability that a route is discovered by a query packet with a hop limit, the probability that a request packet finds a τ-time-valid route or a symmetric-valid route, and the average time needed to discover a valid route. For the route maintenance, some parameters are introduced and studied such as the average frequency of route recovery and the average time of a route to be valid. We compare the two models with spatial reuse and without spatial reuse by evaluating these parameters. It is shown that the spatial reuse model is much more effective in routing.展开更多
A Mobile Ad hoc NETwork (MANET) is a self-organizing, temporary, infrastructure-free, multi-hop, dynamic topology wireless network that contains collection of cooperative autonomous freely roaming mobile nodes. The no...A Mobile Ad hoc NETwork (MANET) is a self-organizing, temporary, infrastructure-free, multi-hop, dynamic topology wireless network that contains collection of cooperative autonomous freely roaming mobile nodes. The nodes communicate with each other by wireless radio links with no human intervention. Each mobile node functions as a specialized router to forward information to other mobile nodes. In order to provide efficient end-to-end communication with the network of nodes, a routing protocol is used to discover the optimal routes between the nodes. The routing protocols meant for wired networks can not be used for mobile ad hoc networks because of the mobility of nodes. Routing in ad hoc networks is nontrivial due to highly dynamic nature of the nodes. Various routing protocols have been proposed and widely evaluated for efficient routing of packets. This research paper presents an overview on classification of wide range of routing protocols for mobile ad hoc wireless networks proposed in the literature and shows the performance evaluation of the routing protocols: DSDV, AODV, FSR, LAR, OLSR, STAR and ZRP using the network simulator QualNet 4.0 to determine which protocols may perform best in large networks. To judge the merit of a routing protocol, one needs performance metrics (throughput, end-to-end delay, jitter, packet delivery ratio, routing overhead) with which to measure its suitability and performance. Our simulation experiments show that the LAR protocol achieve relatively good performance compared to other routing protocols.展开更多
With the increasing enlargement of network scale and the rapid development of network techniques, large numbers of the network applications begin to appear. Packet capture plays an important role as one basic techniqu...With the increasing enlargement of network scale and the rapid development of network techniques, large numbers of the network applications begin to appear. Packet capture plays an important role as one basic technique used in each field of the network applications. In a high-speed network, the heavy traffic of network transmission challenges the packet capture techniques. This paper does an in-depth analysis on the traditional packet capture mechanisms in Linux, and then measures the performance bottleneck in the process of packet capture. The methods for improving the packet capture performance are presented and an optimized packet capture scheme is also designed and implemented. The test demonstrates that the new packet capture mechanism (Libpacket) can greatly improve the packet capture performance of the network application systems in a high-speed network.展开更多
In an ad hoc network, it is usually difficult to optimize the assignment of network routing resources using a single type of routing protocol due to the differences in network scale, node moving mode and node distribu...In an ad hoc network, it is usually difficult to optimize the assignment of network routing resources using a single type of routing protocol due to the differences in network scale, node moving mode and node distribution. Therefore, it is desirable to have nodes run multiple routing protocols simultaneously so that more than one protocols can be chosen to work jointly. For this purpose, a multiple routing platform for Ad hoc networks is proposed on a higher level of current routing protocols. In order to ensure the security of the platform, a security mechanism and its formal analysis by BAN logic is given. The simulation results of the network performance demonstrate that the proposed multi-routing platform is practicable in some complex applications.展开更多
In order to improve the performance of Linux network,new protocols should be implemented and added in original protocol stack. For this demand,this paper has analyzed Linux network stack architecture and implement tec...In order to improve the performance of Linux network,new protocols should be implemented and added in original protocol stack. For this demand,this paper has analyzed Linux network stack architecture and implement technology,then presented a method that appended new protocols in the network stack of Linux. The processes of protocol register ,protocol operation,protocol header implement,packets receiving, user interface are involved in this method.展开更多
阐述了基于IPv6地址的Ad hoc OLSR协议在Linux操作系统上的实现方案及关键技术。根据Linux操作系统中路由体系结构的特点,设计了实现OLSR协议的整体框架,描述实现OLSR协议的程序架构,介绍了在这种架构中实现协议的关键技术,分析支持IPv...阐述了基于IPv6地址的Ad hoc OLSR协议在Linux操作系统上的实现方案及关键技术。根据Linux操作系统中路由体系结构的特点,设计了实现OLSR协议的整体框架,描述实现OLSR协议的程序架构,介绍了在这种架构中实现协议的关键技术,分析支持IPv6地址所需要的实现OLSR协议的主要困难并给出解决方法;最后在实验室搭建实验场景,设计网络拓扑验证该OLSR实现方案的可行性和正确性,着重分析了跳数对分组传输性能的影响。此实现方案具有良好的扩展性和通用性,各种通信路由协议都可以借鉴该方案设计。展开更多
基金supported by the National Science and Technology Major Project of the Ministry of Science and Technology of China (Grant No. 2014ZX03006003)the ZTE Research and Development Fund
文摘A dynamic protocol stack(DPS) for ad hoc networks, together with a protocol stack construction scheme that is modeled as a multiconstrained knapsack problem is proposed. Compared to the traditional static protocol stack, DPS operates in a dynamic and adaptive manner and is scalable to network condition changes. In addition, a protocol construction algorithm is proposed to dynamically construct of the protocol stack each network node. Simulation results show that, the processing and forwarding performance of our scheme is close to 1 Gb/s, and the performance of our algorithm is close to that of the classical algorithms with much lower complexity.
基金Project supported by the National Natural Science Foundation of China (Nos.10471088 and 60572126)the Science Foundation of Shanghai Municipal Commission of Education (No.06ZZ84)
文摘Mobile ad hoc networks (MANETs) have become a hot issue in the area of wireless networks for their non-infrastructure and mobile features. In this paper, a MANET is modeled so that the length of each link in the network is considered as a birthdeath process and the space is reused for n times in the flooding process, which is named as an n-spatiai reuse birth-death model (n-SRBDM). We analyze the performance of the network under the dynamic source routing protocol (DSR) which is a famous reactive routing protocol. Some performance parameters of the route discovery are studied such as the probability distribution and the expectation of the flooding distance, the probability that a route is discovered by a query packet with a hop limit, the probability that a request packet finds a τ-time-valid route or a symmetric-valid route, and the average time needed to discover a valid route. For the route maintenance, some parameters are introduced and studied such as the average frequency of route recovery and the average time of a route to be valid. We compare the two models with spatial reuse and without spatial reuse by evaluating these parameters. It is shown that the spatial reuse model is much more effective in routing.
文摘A Mobile Ad hoc NETwork (MANET) is a self-organizing, temporary, infrastructure-free, multi-hop, dynamic topology wireless network that contains collection of cooperative autonomous freely roaming mobile nodes. The nodes communicate with each other by wireless radio links with no human intervention. Each mobile node functions as a specialized router to forward information to other mobile nodes. In order to provide efficient end-to-end communication with the network of nodes, a routing protocol is used to discover the optimal routes between the nodes. The routing protocols meant for wired networks can not be used for mobile ad hoc networks because of the mobility of nodes. Routing in ad hoc networks is nontrivial due to highly dynamic nature of the nodes. Various routing protocols have been proposed and widely evaluated for efficient routing of packets. This research paper presents an overview on classification of wide range of routing protocols for mobile ad hoc wireless networks proposed in the literature and shows the performance evaluation of the routing protocols: DSDV, AODV, FSR, LAR, OLSR, STAR and ZRP using the network simulator QualNet 4.0 to determine which protocols may perform best in large networks. To judge the merit of a routing protocol, one needs performance metrics (throughput, end-to-end delay, jitter, packet delivery ratio, routing overhead) with which to measure its suitability and performance. Our simulation experiments show that the LAR protocol achieve relatively good performance compared to other routing protocols.
基金Sponsored by the National High Technology Development Program of China (Grant No. 2002AA142020).
文摘With the increasing enlargement of network scale and the rapid development of network techniques, large numbers of the network applications begin to appear. Packet capture plays an important role as one basic technique used in each field of the network applications. In a high-speed network, the heavy traffic of network transmission challenges the packet capture techniques. This paper does an in-depth analysis on the traditional packet capture mechanisms in Linux, and then measures the performance bottleneck in the process of packet capture. The methods for improving the packet capture performance are presented and an optimized packet capture scheme is also designed and implemented. The test demonstrates that the new packet capture mechanism (Libpacket) can greatly improve the packet capture performance of the network application systems in a high-speed network.
文摘In an ad hoc network, it is usually difficult to optimize the assignment of network routing resources using a single type of routing protocol due to the differences in network scale, node moving mode and node distribution. Therefore, it is desirable to have nodes run multiple routing protocols simultaneously so that more than one protocols can be chosen to work jointly. For this purpose, a multiple routing platform for Ad hoc networks is proposed on a higher level of current routing protocols. In order to ensure the security of the platform, a security mechanism and its formal analysis by BAN logic is given. The simulation results of the network performance demonstrate that the proposed multi-routing platform is practicable in some complex applications.
文摘In order to improve the performance of Linux network,new protocols should be implemented and added in original protocol stack. For this demand,this paper has analyzed Linux network stack architecture and implement technology,then presented a method that appended new protocols in the network stack of Linux. The processes of protocol register ,protocol operation,protocol header implement,packets receiving, user interface are involved in this method.
文摘阐述了基于IPv6地址的Ad hoc OLSR协议在Linux操作系统上的实现方案及关键技术。根据Linux操作系统中路由体系结构的特点,设计了实现OLSR协议的整体框架,描述实现OLSR协议的程序架构,介绍了在这种架构中实现协议的关键技术,分析支持IPv6地址所需要的实现OLSR协议的主要困难并给出解决方法;最后在实验室搭建实验场景,设计网络拓扑验证该OLSR实现方案的可行性和正确性,着重分析了跳数对分组传输性能的影响。此实现方案具有良好的扩展性和通用性,各种通信路由协议都可以借鉴该方案设计。