Towards Optimal Distributed Node Scheduling in a Multihop Wireless Network through Local Voting

In a multihop wireless network, it is crucial but challenging to schedule transmissions in an efficient and fair manner. In this paper, a novel distributed node scheduling algorithm, called Local Voting, is proposed. This algorithm tries to semi-equalize the load (defined as the ratio of the queue length over the number of allocated slots) through slot reallocation based on local information exchange. The algorithm stems from the finding that the shortest delivery time or delay is obtained when the load is semi-equalized throughout the network. In addition, we prove that, with Local Voting, the network system converges asymptotically towards the optimal scheduling. Moreover, through extensive simulations, the performance of Local Voting is further investigated in comparison with several representative scheduling algorithms from the literature. Simulation results show that the proposed algorithm achieves better performance than the other distributed algorithms in terms of average delay, maximum delay, and fairness. Despite being distributed, the performance of Local Voting is also found to be very close to a centralized algorithm that is deemed to have the optimal performance

Optimisation of Mobile Communication Networks - OMCO NET

The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University. The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing

Carrier Sense Random Packet CDMA Protocol in Dual-Channel Networks

Code resource wastage is caused by the reason that many hopping frequency (FH) sequences are unused, which occurs under the condition that the number of the actual subnets needed for the tactical network is far smaller than the networking capacity of code division net¬working. Dual-channel network (DCN), consisting of one single control channel and multiple data channels, can solve the code resource wastage effectively. To improve the anti-jamming capability of the control channel of DCN, code division multiple access (CDMA) technology was introduced, and a carrier sense random packet (CSRP) CDMA protocol based on random packet CDMA (RP-CDMA) was proposed. In CSRP-CDMA, we provide a carrier sensing random packet mechanism and a packet-segment acknowledgement policy. Furthermore, an analytical model was developed to evaluate the performance of CSRP-CDMA networks. In this model, the impacts of multi-access interference from both inter-clusters and intra-clusters were analyzed, and the mathematical expressions of packet transmission success probability, normalized network throughput and signal interference to noise ratio, were also derived. Analytical and simulation results demonstrate that the normalized network throughput of CSRP-CDMA outperforms traditional RP-CDMA by 10%, which can guarantee the resource utilization efficiency of the control channel in DCNs