Since wireless links in Ad hoc networks are more fragile than those in traditional wireless networks due to route flapping,multi-node cooperation plays an important role in ensuring the quality of service( QoS). Based...Since wireless links in Ad hoc networks are more fragile than those in traditional wireless networks due to route flapping,multi-node cooperation plays an important role in ensuring the quality of service( QoS). Based on the authors' previous work,this paper proposes a receiver-controlled multi-node cooperation routing protocol,known as AODV-RCC. In this protocol,nodes form a cooperation group based on signal power. In a cooperation group,signal power between a partner and a transmitter,as well as signal power between the partner and the receiver,must be larger than the signal power between the transmitter and the receiver. Otherwise,the transmission will not benefit from cooperation. To avoid collision or congestion,each cooperation group only contains one partner. This partner offers both data and ACK cooperative retransmission. Its retransmission time should be shorter than the internal retry time of the transmitter's MAC layer,because it is better for the partner to retransmit firstly,as it offers a more reliable cooperative link. In AODV-RCC,it is the receiver that chooses the partner,because the link between the partner and the receiver is the most important. According to our simulation results,AODV-RCC shortens the end-to-end delay and increases the packet delivery ratio.展开更多
Closed form expressions for the PDF and MGF of the harmonic mean of two independent exponential variates are cited and derived, and then applied to study the performance of cellular multi-node and dual-hop cooperative...Closed form expressions for the PDF and MGF of the harmonic mean of two independent exponential variates are cited and derived, and then applied to study the performance of cellular multi-node and dual-hop cooperative communication systems with non-regenerative relays over flat Rayleigh fading channels. We derive the probability density function (PDF) and asymptotic symbol error rate (SER) expression with MRC scheme. Then we use Matlab to simulate the performance.展开更多
This paper presents the derivation of an analytical model for a multi-queue nodes network router, which is referred to as the multi-queue nodes （mQN） model. In this model, expressions are derived to calculate two pe...This paper presents the derivation of an analytical model for a multi-queue nodes network router, which is referred to as the multi-queue nodes （mQN） model. In this model, expressions are derived to calculate two performance metrics, namely, the queue node and system utilization factors. In order to demonstrate the flexibility and effectiveness of the mQN model in analyzing the performance of an mQN network router, two scenarios are performed. These scenarios investigated the variation of queue nodes and system utilization factors against queue nodes dropping probability for various system sizes and packets arrival routing probabilities. The performed scenarios demonstrated that the mQN analytical model is more flexible and effective when compared with experimental tests and computer simulations in assessing the performance of an mQN network router.展开更多
In Wireless Sensor Network (WSNs), sensor nodes collect data and send them to a Base Station (BS) for further processing. One of the most issues in WSNs that researchers have proposed a hundred of technique to solve i...In Wireless Sensor Network (WSNs), sensor nodes collect data and send them to a Base Station (BS) for further processing. One of the most issues in WSNs that researchers have proposed a hundred of technique to solve its impact is the energy constraint since sensor nodes have small battery, small memory and less data processing with low computational capabilities. However, many researches efforts have focused on how to prolong the battery lifetime of sensor nodes by proposing different routing, MAC, localization, data aggregation, topology construction techniques. In this paper, we will focus on routing techniques which aim to prolonging the network lifetime. Hence, we propose an Energy-Efficient Routing technique in WSNs based on Stationary and Mobile nodes (EERSM). Sensing filed is divided into intersected circles which contain Mobile Nodes (MN). The proposed data aggregation technique via the circular topology will eliminate the redundant data to be sent to the Base Station (BS). MN in each circle will rout packets for their source nodes, and move to the intersected area where another MN is waiting (sleep mode) to receive the transmitted packet, and then the packet will be delivered to the next intersected area until the packet is arrived to the BS. Our proposed EERSM technique is simulated using MATLAB and compared with conventional multi-hop techniques under different network models and scenarios. In the simulation, we will show how the proposed EERSM technique overcomes many routing protocols in terms of the number of hops counted when sending packets from a source node to the destination (i.e. BS), the average residual energy, number of sent packets to the BS, and the number of a live sensor nodes verse the simulation rounds.展开更多
Nodes cooperation is a significant prerequisite for the realization of the relaying Ad Hoc.While with the development of multi-hop cellular networks, how to stimulate intermediate nodes to do the packet-forwarding des...Nodes cooperation is a significant prerequisite for the realization of the relaying Ad Hoc.While with the development of multi-hop cellular networks, how to stimulate intermediate nodes to do the packet-forwarding deserves more concerning.At present research,the incentive schemes in pure Ad Hoc and multi-hop cellular networks are analyzed and compared to classify the strengths and drawbacks of each scheme.We explain in particular what the key issues are to implement incentive schemes for cooperation. Finally,an incentive scheme based on integration of reputation and charging systems is proposed not only to block the existence of selfish nodes,but to satisfy the rational requirement of nodes.展开更多
This paper proposed a multi-domain virtual network embedding algorithm based on multi-controller SDN architecture. The local controller first selects candidate substrate nodes for each virtual node in the domain. Then...This paper proposed a multi-domain virtual network embedding algorithm based on multi-controller SDN architecture. The local controller first selects candidate substrate nodes for each virtual node in the domain. Then the global controller abstracts substrate network topology based on the candidate nodes and boundary nodes of each domain, and applies Particle Swarm Optimization Algorithm on it to divide virtual network requests. Each local controller then embeds the virtual nodes of the divided single-domain virtual network requests in the domain, and cooperates with other local controllers to embed the inter-domain virtual links. Simulation experimental results show that the proposed algorithm has good performance in reducing embedding cost with good stability and scalability.展开更多
Classical network reliability problems assume both net- works and components have only binary states, fully working or fully failed states. But many actual networks are multi-state, such as communication networks and ...Classical network reliability problems assume both net- works and components have only binary states, fully working or fully failed states. But many actual networks are multi-state, such as communication networks and transportation networks. The nodes and arcs in the networks may be in intermediate states which are not fully working either fully failed. A simulation ap- proach for computing the two-terminal reliability of a multi-state network is described. Two-terminal reliability is defined as the probability that d units of demand can be supplied from the source to sink nodes under the time threshold T. The capacities of arcs may be in a stochastic state following any discrete or continuous distribution. The transmission time of each arc is also not a fixed number but stochastic according to its current capacity and de- mand. To solve this problem, a capacitated stochastic coloured Petri net is proposed for modelling the system behaviour. Places and transitions respectively stand for the nodes and arcs of a net- work. Capacitated transition and self-modified token colour with route information are defined to describe the multi-state network. By the simulation, the two-terminal reliability and node importance can be estimated and the optimal route whose reliability is highest can also be given. Finally, two examples of different kinds of multi- state networks are given.展开更多
基金Sponsored by the Natural Scientific Research Innovation Foundation in Harbin Institute of Technology(Grant No.HIT.NSRIF.2013029)the National Science and Technology Major Project(Grant No.2012ZX03004003)+1 种基金the National Basic Research Development Program of China(973 Program)(Grant No.2013CB329003)the National Natural Science Foundation of China(Grant No.61201148 and No.61101123)
文摘Since wireless links in Ad hoc networks are more fragile than those in traditional wireless networks due to route flapping,multi-node cooperation plays an important role in ensuring the quality of service( QoS). Based on the authors' previous work,this paper proposes a receiver-controlled multi-node cooperation routing protocol,known as AODV-RCC. In this protocol,nodes form a cooperation group based on signal power. In a cooperation group,signal power between a partner and a transmitter,as well as signal power between the partner and the receiver,must be larger than the signal power between the transmitter and the receiver. Otherwise,the transmission will not benefit from cooperation. To avoid collision or congestion,each cooperation group only contains one partner. This partner offers both data and ACK cooperative retransmission. Its retransmission time should be shorter than the internal retry time of the transmitter's MAC layer,because it is better for the partner to retransmit firstly,as it offers a more reliable cooperative link. In AODV-RCC,it is the receiver that chooses the partner,because the link between the partner and the receiver is the most important. According to our simulation results,AODV-RCC shortens the end-to-end delay and increases the packet delivery ratio.
文摘Closed form expressions for the PDF and MGF of the harmonic mean of two independent exponential variates are cited and derived, and then applied to study the performance of cellular multi-node and dual-hop cooperative communication systems with non-regenerative relays over flat Rayleigh fading channels. We derive the probability density function (PDF) and asymptotic symbol error rate (SER) expression with MRC scheme. Then we use Matlab to simulate the performance.
文摘This paper presents the derivation of an analytical model for a multi-queue nodes network router, which is referred to as the multi-queue nodes （mQN） model. In this model, expressions are derived to calculate two performance metrics, namely, the queue node and system utilization factors. In order to demonstrate the flexibility and effectiveness of the mQN model in analyzing the performance of an mQN network router, two scenarios are performed. These scenarios investigated the variation of queue nodes and system utilization factors against queue nodes dropping probability for various system sizes and packets arrival routing probabilities. The performed scenarios demonstrated that the mQN analytical model is more flexible and effective when compared with experimental tests and computer simulations in assessing the performance of an mQN network router.
文摘In Wireless Sensor Network (WSNs), sensor nodes collect data and send them to a Base Station (BS) for further processing. One of the most issues in WSNs that researchers have proposed a hundred of technique to solve its impact is the energy constraint since sensor nodes have small battery, small memory and less data processing with low computational capabilities. However, many researches efforts have focused on how to prolong the battery lifetime of sensor nodes by proposing different routing, MAC, localization, data aggregation, topology construction techniques. In this paper, we will focus on routing techniques which aim to prolonging the network lifetime. Hence, we propose an Energy-Efficient Routing technique in WSNs based on Stationary and Mobile nodes (EERSM). Sensing filed is divided into intersected circles which contain Mobile Nodes (MN). The proposed data aggregation technique via the circular topology will eliminate the redundant data to be sent to the Base Station (BS). MN in each circle will rout packets for their source nodes, and move to the intersected area where another MN is waiting (sleep mode) to receive the transmitted packet, and then the packet will be delivered to the next intersected area until the packet is arrived to the BS. Our proposed EERSM technique is simulated using MATLAB and compared with conventional multi-hop techniques under different network models and scenarios. In the simulation, we will show how the proposed EERSM technique overcomes many routing protocols in terms of the number of hops counted when sending packets from a source node to the destination (i.e. BS), the average residual energy, number of sent packets to the BS, and the number of a live sensor nodes verse the simulation rounds.
基金supported by National "863" High Technology Research and Development Program Foundation(No.2006AA01Z208)Six Talented Eminence Foundation of Jiangsu Province+1 种基金Natural Science Foundation of Jiangsu Province(No. BK2004149)Green-Blue Academic Talented Project Foundation of Jiangsu Province
文摘Nodes cooperation is a significant prerequisite for the realization of the relaying Ad Hoc.While with the development of multi-hop cellular networks, how to stimulate intermediate nodes to do the packet-forwarding deserves more concerning.At present research,the incentive schemes in pure Ad Hoc and multi-hop cellular networks are analyzed and compared to classify the strengths and drawbacks of each scheme.We explain in particular what the key issues are to implement incentive schemes for cooperation. Finally,an incentive scheme based on integration of reputation and charging systems is proposed not only to block the existence of selfish nodes,but to satisfy the rational requirement of nodes.
基金supported by "the Fundamental Research Funds for the Central Universities" of China University of Petroleum (East China) (Grant No. 18CX02139A)the National Natural Science Foundation of China (Grant No. 61471056)
文摘This paper proposed a multi-domain virtual network embedding algorithm based on multi-controller SDN architecture. The local controller first selects candidate substrate nodes for each virtual node in the domain. Then the global controller abstracts substrate network topology based on the candidate nodes and boundary nodes of each domain, and applies Particle Swarm Optimization Algorithm on it to divide virtual network requests. Each local controller then embeds the virtual nodes of the divided single-domain virtual network requests in the domain, and cooperates with other local controllers to embed the inter-domain virtual links. Simulation experimental results show that the proposed algorithm has good performance in reducing embedding cost with good stability and scalability.
基金supported by the National Natural Science Foundation of China (70971132)
文摘Classical network reliability problems assume both net- works and components have only binary states, fully working or fully failed states. But many actual networks are multi-state, such as communication networks and transportation networks. The nodes and arcs in the networks may be in intermediate states which are not fully working either fully failed. A simulation ap- proach for computing the two-terminal reliability of a multi-state network is described. Two-terminal reliability is defined as the probability that d units of demand can be supplied from the source to sink nodes under the time threshold T. The capacities of arcs may be in a stochastic state following any discrete or continuous distribution. The transmission time of each arc is also not a fixed number but stochastic according to its current capacity and de- mand. To solve this problem, a capacitated stochastic coloured Petri net is proposed for modelling the system behaviour. Places and transitions respectively stand for the nodes and arcs of a net- work. Capacitated transition and self-modified token colour with route information are defined to describe the multi-state network. By the simulation, the two-terminal reliability and node importance can be estimated and the optimal route whose reliability is highest can also be given. Finally, two examples of different kinds of multi- state networks are given.
