Low Packet Research Articles

Dominating Set and Network Coding-Based Routing in Wireless Mesh Networks

Wireless mesh networks are widely applied in many fields such as industrial controlling, environmental monitoring, and military operations. Network coding is promising technology that can improve the performance of wireless mesh networks. In particular, network coding is suitable for wireless mesh networks as the fixed backbone of wireless mesh is usually unlimited energy. However, coding collision is a severe problem affecting network performance. To avoid this, routing should be effectively designed with an optimum combination of coding opportunity and coding validity. In this paper, we propose a Connected Dominating Set (CDS)-based and Flow-oriented Coding-aware Routing (CFCR) mechanism to actively increase potential coding opportunities. Our work provides two major contributions. First, it effectively deals with the coding collision problem of flows by introducing the information conformation process, which effectively decreases the failure rate of decoding. Secondly, our routing process considers the benefit of CDS and flow coding simultaneously. Through formalized analysis of the routing parameters, CFCR can choose optimized routing with reliable transmission and small cost. Our evaluation shows CFCR has a lower packet loss ratio and higher throughput than existing methods, such as Adaptive Control of Packet Overhead in XOR Network Coding (ACPO), or Distributed Coding-Aware Routing (DCAR).

Intelligent Information Dissemination Scheme for Urban Vehicular Ad Hoc Networks

In vehicular ad hoc networks (VANETs), a hotspot, such as a parking lot, is an information source and will receive inquiries from many vehicles for seeking any possible free parking space. According to the routing protocols in literature, each of the vehicles needs to flood its route discovery (RD) packets to discover a route to the hotspot before sending inquiring packets to the parking lot. As a result, the VANET nearby an urban area or city center may incur the problem ofbroadcast stormdue to so many flooding RD packets during rush hours. To avoid the broadcast storm problem, this paper presents ahotspot-enabledrouting-tree based data forwarding method, called the intelligent information dissemination scheme (IID). Our method can let the hotspot automatically decide when to build the routing-tree for proactive information transmissions under the condition that the number of vehicle routing discoveries during a given period exceeds a certain threshold which is calculated through our developed analytical packet delivery model. The routing information will be dynamically maintained by vehicles located at each intersection near the hotspot if the maintaining cost is less than that of allowing vehicles to discover routes themselves. Simulation results show that this method can minimize routing delays for vehicles with lower packets delivery overheads.

Cooperative Optimization QoS Cloud Routing Protocol Based on Bacterial Opportunistic Foraging and Chemotaxis Perception for Mobile Internet

In order to strengthen the mobile Internet mobility management and cloud platform resources utilization, optimizing the cloud routing efficiency is established, based on opportunistic bacterial foraging bionics, and puts forward a chemotaxis perception of collaborative optimization QoS (Quality of Services) cloud routing mechanism. The cloud routing mechanism is based on bacterial opportunity to feed and bacterial motility and to establish the data transmission and forwarding of the bacterial population behavior characteristics. This mechanism is based on the characteristics of drug resistance of bacteria and the structure of the field, and through many iterations of the individual behavior and population behavior the bacteria can be spread to the food gathering area with a certain probability. Finally, QoS cloud routing path would be selected and optimized based on bacterial bionic optimization and hedge mapping relationship between mobile Internet node and bacterial population evolution iterations. Experimental results show that, compared with the standard dynamic routing schemes, the proposed scheme has shorter transmission delay, lower packet error ratio, QoS cloud routing loading, and QoS cloud route request overhead.

Analysis of the IEEE 802.15.4 MAC Parameters to Achieve Lower Packet Loss Rates

Abstract The IEEE-802.15.4 standard utilizes the CSMA-CA mechanism to control nodes access to the channel communication. It is becoming the popular choice for various applications of surveillance and control used in wireless sensor network (WSN). The benefit of this standard is evaluated regarding of the packet loss probability that depends on the configuration of IEEE 802.15.4 MAC parameters and the traffic load. Our exigency is to evaluate the effects of various configurable MAC parameters on the performance of beaconless IEEE 802.15.4 networks, under different traffic loads. Static values of IEEE 802.15.4 MAC parameters (macMinBE, macMaxCSMABackoffs, CW, and macMaxFrame Retries) will be evaluated. To evaluate the performance of the protocol, we use ns-2 network simulator.

An automated testbed for profiling the packet send-time accuracy of embedded devices

Embedded devices, such as home routers or single-board computers, are becoming more powerful and affordable. Many of the existing Linux-based network measurement tools can also be run on these devices through cross-compilation. These features provide more incentive for network administrators or researchers to employ them as network measurement probes. Large-scale measurement projects, such as BISMark and RIPE, have already deployed more than hundreds of home routers as vantage points to measure the Internet from the edge.Our previous work showed that these embedded devices have much lower packet send-time accuracy compared to commodity PC. The lower accuracy limits their ability to acquire sound measurement results in high-speed networks. In this poster, we present an automated testbed to systematically benchmark the performance of four popular embedded devices (Raspberry Pi I & II, ECS LIVA, and a TP-Link Travel Router) and suggest the network types that they can accurately measure. The testbed can also evaluate the performance of the kernel-space tools using OMware. The results can be visualized through a web interface, thus enabling users to compare various devices easily.

Lane Adaptive Recovery for Multiple Lane Faults in Optical Ethernet Link

We propose a lane adaptive recovery scheme for multiple lane faults in a multi-lane-based Ethernet link. In our scheme, when lane faults occur in a link, they are processed not as full link faults but as partial link faults. Our scheme provides a higher link utilization and lower packet loss rate by reusing the available lanes of the link and providing a low recovery time of under a microsecond.

A novel disjoint set division algorithm for joint scheduling and routing in wireless sensor networks

High network connectivity and low energy consumption are two major challenges in wireless sensor networks (WSNs). It is even more challenging to achieve both at the same time. To tackle the problem, this paper proposes a novel disjoint Set Division (SEDO) algorithm for joint scheduling and routing in WSNs. We finely divide sensors into different disjoint sets with guaranteed connectivity based on their geographical locations to monitor the interested area. We propose a class of scheduling and routing algorithms, which sequentially schedule each disjoint set to be on and off and balance the energy consumption during packet transmission. Simulation results show that SEDO outperforms existing schemes with lower packet delivery latency and longer network lifetime.

Virtual Clustered MAC Layer Protocol Design of a Wireless Sensor Network: ES-MAC

Sensor-MAC (S-MAC), one kind of use common type activities / sleep cycle wireless sensor network MAC layer protocol, we propose a strengthening type Enhanced S-MAC, called ES-MAC, and part of its application in wireless sensor networks than the outer layer of low traffic. ES-MAC is divided into three stages: the first stage is to create a virtual cluster region and preset transmission path; third stage of data transfer; second stage of data collection and sorting. Sensing node virtual cluster in the region, competitive manner using micro slot (Mini-Slot) determine the order of data transmission. In the data transfer phase has been established using the sequential transfer of data, the sense node in order to reduce the unnecessary and excessive collision monitoring, sleep time, and the growth of nodes. Simulation results show that, ES-MAC under different flow and different cycles, compared with S-MAC has lower average packet delay time.

An Energy Efficient MAC Protocol for Fully Connected Wireless Ad Hoc Networks

Energy efficiency is an important performance measure of wireless network protocols, particularly for battery-powered mobile devices such as smartphones. This paper presents a new energy efficient medium access control (MAC) scheme for fully connected wireless ad hoc networks. The proposed scheme reduces energy consumption by putting radio interfaces in the sleep state periodically and by reducing transmission collisions, which results in high throughput and low packet transmission delay. The proposed MAC scheme can also address energy saving in realtime traffics, which require very low packet transmission delay. An analytical model is established to evaluate the performance of the proposed MAC scheme. Analytical and simulation results demonstrate that the proposed scheme has significantly lower power consumption, achieves substantially higher throughput, and has lower packet transmission delay in comparison with existing power saving MAC protocols.

IEEE 802.11n WLAN에서 블록 승인 기반의 동적 A-MPDU 집적 방법

By adopting the MAC(Media Access Control) protocol which enables to pack multiple MPDUs(MAC-level Protocol Data Units) into a single PPDU(Physical Layer Protocol Data Unit), IEEE 802.11n WLAN supports high throughput. Up to now, there have been a lot of existing channel information-based A-MPDU schemes dynamically determining the number of MSDUs according to the wireless channel condition information which is sent from the receiver to sender. However, the channel information-based scheme has a serious drawback having a high system overhead due to the frequent channel feedback information. To reduce the system overhead, the proposed BA-base dynamic A-MPDU scheme simply chooses the number of MSDUs to be retransmitted by not the frequent channel feedback information but the BA signal representing whether MPSUs belonging to the A-MPDU are received or not. Through NS-2(Network Simulator-2), we found that the proposed scheme had higher throughput and lower packet error rate than the existing fixed A-MPDU scheme.

TLR: A Traffic-Light-Based Intelligent Routing Strategy for NGEO Satellite IP Networks

We present TLR, a traffic-light-based intelligent routing strategy for NGEO satellite IP networks. In TLR, a set of traffic lights are used to indicate the congestion status at both the current node and the next node. When a packet travels along a pre-calculated route to the destination, it may adjust the route dynamically, according to the real-time color of traffic lights at each intermediate node. Through the combination of preliminary planning and real-time adjustment, each packet can eventually get an approximately optimal transmission path. The multi-path routing mechanism in TLR can help achieve a good distribution of traffics when the network traffic increases. The Public Waiting Queue scheme in TLR can fully utilize free spaces of the buffer queues and lower the packet drop rate. While the concept of TLR has many advantages, it may result in endless-loop of routing. To eliminate this phenomenon, a defense scheme is incorporated in the design of TLR. A set of simulations are conducted using the Network Simulator (version 2) to verify the good performance of TLR, in terms of lower packet drop rate, better distribution of traffics and higher throughput, over the entire satellite constellation.

New hybrid reverse differential pulse position width modulation scheme for wireless optical communication

In order to improve the power efficiency and reduce the packet error rate of reverse differential pulse position modulation (RDPPM) for wireless optical communication (WOC), a hybrid reverse differential pulse position width modulation (RDPPWM) scheme is proposed, based on RDPPM and reverse pulse width modulation. Subsequently, the symbol structure of RDPPWM is briefly analyzed, and its performance is compared with that of other modulation schemes in terms of average transmitted power, bandwidth requirement, and packet error rate over ideal additive white Gaussian noise (AWGN) channels. Based on the given model, the simulation results show that the proposed modulation scheme has the advantages of improving the power efficiency and reducing the bandwidth requirement. Moreover, in terms of error probability performance, RDPPWM can achieve a much lower packet error rate than that of RDPPM. For example, at the same received signal power of −28 dBm, the packet error rate of RDPPWM can decrease to 2.6×10−12, while that of RDPPM is 2.2×10−8. Furthermore, RDPPWM does not need symbol synchronization at the receiving end. These considerations make RDPPWM a favorable candidate to select as the modulation scheme in the WOC systems.

Study on Migration from IPv4 to IPv6 of a Large Scale Network

This work mainly addresses the design a large scale network using dual stack mechanisms. We concentrated on the most imperative theoretical notions of the IPv6 protocol, such as IP addressing, address allocation, routing with the OSPF and BGP protocols and routing protocols performance in dual stack network using GNS3 simulations and Wireshark Network protocol analyzer. It is evaluate a real large-scale network environment utilizing accessible end-to-end estimation methods that focuses on a large-scale IPv4 and IPv6 backbone and made performance the IPv4 and IPv6 network. In this paper, we compiled IPv6 address planning in a large scale network, performance metrics of each network in terms of time sequence graph, round trip time, TCP throughput, TCP connection time and the number of TCP connections per second that a client can establish with a remote server. It is found that, a minor degradation in the throughput of the TCP, TCP response time and a lower packet loss rate are arise in a real large scale dual stack network. We also showed a concise case study on relationship between RTT and network topology, which is cooperative to develop the performance of IPv6 networks. The result shows the proposed scheme for network migration from IPv4 to IPv6 is more reliable than other existing schemes.

Adaptive Distributed Load Balancing Routing Mechanism for LEO Satellite IP Networks

LEO (Low Earth Orbit) satellite constellation is an ideal scheme for the next generation wideband internet. The constellation is formed as a mesh-like network with inter satellite links (ISLs) which are equipped between the neighbor satellites for transmitting directly. As to the future wideband IP services, an efficient routing mechanism will play an important role in improving the performance and balancing the network traffic. An Adaptive Distributed Load Balancing Routing Mechanism (ADLB) is proposed in this paper to address the above-mentioned issues. This mechanism makes well-performed routing decision based on the current and historical status of each ISLs in each satellite node. With collecting historical information from network initiated, a proper mechanism is contained in ADLB for making required computing power and storage space in a reasonable range. The performance of ADLB is verified via a series of simulations which demonstrate that the scheme can provide better throughput and lower packet drop rate.

On the Migration of a Large Scale Network from IPv4 to IPv6 Environment

This work mainly addresses the design a large scale network using dual stack mechanisms. We focused on the most important theoretical concepts of the IPv6 protocol, such as addressing, address allocation, routing with the OSPF and BGP protocols and routing protocols performance in dual stack network using GNS3 and Wireshark simulators. we have a tendency to measure a perfect model and a true large-scale network atmosphere victimization out there end-to-end activity techniques that focuses on a large-scale IPv4 and IPv6 backbone and created performance the IPv4 and IPv6 network. In this paper, we compiled IPv6 address planning in large scale network, performance statistics of each network in terms of TCP throughput, delay jitters, packet loss rate, and round trip time. It is found that, a minor degradation within the throughput of the TCP, delay jitter, a lower packet loss rate, and a rather longer round trip time are occurred in a real large scale dual stack network.

Realistic Vehicular Mobility Impact of FTM, IDM, IDM-IM and IDM-LC on VANETs

ABSTRACT VANETs are composed of a number of vehicles moving on city roads, able to interconnect with one another without a fixed infrastructure. Improvisation of a new vehicular communication system should entitle a node to travel safely with high speed mobility while maintaining seamless interconnectivity. To evaluate the impact of mobility models such as FTM, IDM, IDM-IM and IDM-LC on VANETs routing protocol, VanetMobiSim is introduced to design a realistic vehicular mobility model for an urban scenario of Dhaka city. The experimental results suggest several issues e.g. lower packet drop rate, delay, jitter and route cost, etc are required to be considered before preparing a realistic application of VANET. The simulation results have been measured by different performance metrics such as drop, delay, jitter, round-trip time, throughput, route cost and mean hop etc. Keywords VANET; AODV; AOMDV; DYMO; OLSR; FTM; IDM-IM; IDM-LC; IDM; IEEE 802.11p;

SSVHOP: A Simple and Seamless Vertical Handoff Protocol for Loosely Coupled Integrated UMTS/WLAN Network

To provide anywhere at any time services in an integrated wireless networking environment, seamless mobility is one of the most important and challenging issues. Recent literature shows that the seamless mobility can be achieved by performing significant modifications in existing network designs and protocol architectures. However, such intensive modification increases the network implementation complexity and deployment cost. In this study , we have proposed a Simple and Seamless Vertical Handoff Protocol (SSVHOP) to attain the seamless mobility without implementing any major modification in the existing network topology or protocol architecture. The foundations of the underlying principle of the SSVHOP are based on a proactive RSS handoff triggering mechanism and multi-homing capabilities of mobile terminal. In addition, SSVHOP reduces the signaling and processing cost of the network to achieve low handoff delay and packet loss during upward and downward vertical handoff scenarios. Moreover, it has been observed that the proposed design also improves the data session performance by routing the data packets on the optimal route and by introducing an overhead free mechanism for data transportation in an integrated UMTS/WLAN network. We evaluated and compared the SSVHOP with the tight coupling mechanism. By analyzing mathematical modeling and simulation results, it is evident that the SSVHOP performs better than the tight coupling mechanism for all tested applications and measurement parameters.

An Empirical Evaluation of Lightweight Random Walk Based Routing Protocol in Duty Cycle Aware Wireless Sensor Networks

Energy efficiency is an important design paradigm in Wireless Sensor Networks (WSNs) and its consumption in dynamic environment is even more critical. Duty cycling of sensor nodes is used to address the energy consumption problem. However, along with advantages, duty cycle aware networks introduce some complexities like synchronization and latency. Due to their inherent characteristics, many traditional routing protocols show low performance in densely deployed WSNs with duty cycle awareness, when sensor nodes are supposed to have high mobility. In this paper we first present a three messages exchange Lightweight Random Walk Routing (LRWR) protocol and then evaluate its performance in WSNs for routing low data rate packets. Through NS-2 based simulations, we examine the LRWR protocol by comparing it with DYMO, a widely used WSN protocol, in both static and dynamic environments with varying duty cycles, assuming the standard IEEE 802.15.4 in lower layers. Results for the three metrics, that is, reliability, end-to-end delay, and energy consumption, show that LRWR protocol outperforms DYMO in scalability, mobility, and robustness, showing this protocol as a suitable choice in low duty cycle and dense WSNs.

A new composite assembly mechanism for supporting QoS in OBS networks

To provide the differential quality of service (QoS) for different classes of packets and reduce the packet loss probability (PLP), a novel priority-based composite assembly scheme for optical burst switching (OBS) networks is proposed. The low and high packet classes are aggregated into a single burst simultaneously, and the highest-priority packets are placed in the middle, while the low-priority packets are at the tail and head of the burst. The priority is lowered gradually from the middle to the ends. Simulation results demonstrate that the proposed assembly strategy not only guarantees the integrity of the high-priority bursts, but also significantly reduces the average end-to-end delay of the bursts and the PLP of network. So it can adapt to the flexible network with QoS requirement.

Hybrid Single-Packet IP Traceback with Low Storage and High Accuracy

Traceback schemes have been proposed to trace the sources of attacks that usually hide by spoofing their IP addresses. Among these methods, schemes using packet logging can achieve single-packet traceback. But packet logging demands high storage on routers and therefore makes IP traceback impractical. For lower storage requirement, packet logging and packet marking are fused to make hybrid single-packet IP traceback. Despite such attempts, their storage still increases with packet numbers. That is why RIHT bounds its storage with path numbers to guarantee low storage. RIHT uses IP header's ID and offset fields to mark packets, so it inevitably suffers from fragment and drop issues for its packet reassembly. Although the 16-bit hybrid IP traceback schemes, for example, MORE, can mitigate the fragment problem, their storage requirement grows up with packet numbers. To solve the storage and fragment problems in one shot, we propose a single-packet IP traceback scheme that only uses packets' ID field for marking. Our major contributions are as follows: (1) our fragmented packets with tracing marks can be reassembled; (2) our storage is not affected by packet numbers; (3) it is the first hybrid single-packet IP traceback scheme to achieve zero false positive and zero false negative rates.