An Adaptive Location-Aware MAC Protocol for Multichannel Multihop Ad-Hoc Networks
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
Bottleneck-first scheduling for real-time traffic in IEEE 802.11 infrastructure-based mesh networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
A multi-channel defense against jamming attacks in wireless sensor networks
Proceedings of the 3rd ACM workshop on QoS and security for wireless and mobile networks
Distributed scheduling algorithms for channel access in TDMA wireless mesh networks
The Journal of Supercomputing
An End-to-End Packet Delay Optimization for QoS in a MANET
ICESS '07 Proceedings of the 3rd international conference on Embedded Software and Systems
Connection-based scheduling for supporting real-time traffic in wireless mesh networks
IEEE Transactions on Wireless Communications
Access scheduling on the control channels in TDMA wireless mesh networks
MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
Access scheduling on the control channels in TDMA wireless mesh networks
ICCSA'07 Proceedings of the 2007 international conference on Computational science and Its applications - Volume Part II
Journal of Network and Computer Applications
Dynamic channel allocation with location awareness for multi-hop mobile ad hoc networks
Computer Communications
Variable weight sequences for adaptive scheduled access in MANETs
SETA'12 Proceedings of the 7th international conference on Sequences and Their Applications
Distributed scheduling algorithms for channel access in TDMA wireless mesh networks
The Journal of Supercomputing
| Hi-index | 0.07 |
Many transmission scheduling algorithms have been proposed to maximize spatial reuse and minimize the time division multiple access (TDMA) frame length in multihop packet radio networks. Almost all existing algorithms assume exact network topology information and require recomputations when the network topology changes. In addition, existing work focuses on single channel TDMA systems. In this paper, we propose a multichannel topology-transparent algorithm based on latin squares. The proposed algorithm has the flexibility to allow the growth of the network, i.e., the network can add more mobile nodes without recomputation of transmission schedules for existing nodes. At the same time, a minimum throughput is guaranteed. We analyze the efficiency of this algorithm and examine the topology-transparent characteristics and the sensitivity on design parameters by analytical and simulation techniques