An Adaptive TDMA Slot Assignment Protocol in Ad Hoc Sensor Networks Akimitsu Kanzaki, Takahiro Hara and Shojiro Nishio ACM Symposium on Applied Computing,

Slides:



Advertisements
Similar presentations
Nick Feamster CS 4251 Computer Networking II Spring 2008
Advertisements

A 2 -MAC: An Adaptive, Anycast MAC Protocol for Wireless Sensor Networks Hwee-Xian TAN and Mun Choon CHAN Department of Computer Science, School of Computing.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
TDMA Scheduling in Wireless Sensor Networks
5/5/20151 Mobile Ad hoc Networks COE 549 Transmission Scheduling II Tarek Sheltami KFUPM CCSE COE
ATMA: Advertisement-based TDMA Protocol for Bursty Traffic in Wireless Sensor Networks Surjya Ray, Illker Demirkol, and Wendi Heinzeleman University of.
Lecture 9: Multiple Access Protocols
LECTURE 11 CT1303 LAN. DYNAMIC MAC PROTOCOL No fixed assignment for transmission media or any network resources.. It allows transmission when needed.
Channel Access Methods When several devices are connected to a single channel, there must be some rules to govern these devices as they access, transmit,
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 17 Introduction to Computer Networks.
Energy-efficient collision-free medium access control for wireless sensor networks Venkatesh Rajendran Katia Obraczka Garcia-Luna-Aceves Department of.
Self Organization and Energy Efficient TDMA MAC Protocol by Wake Up For Wireless Sensor Networks Zhihui Chen; Ashfaq Khokhar ECE/CS Dept., University of.
An Energy-efficient MAC protocol for Wireless Sensor Networks
Hop reservation multiple access (HRMA) for multichannel packet radio networks Zhenyu Tang; Garcia-Luna-Aceves, J.J. Computer Communications and Networks,
TiZo-MAC The TIME-ZONE PROTOCOL for mobile wireless sensor networks by Antonio G. Ruzzelli Supervisor : Paul Havinga This work is performed as part of.
1 ECE453 – Introduction to Computer Networks Lecture 7 – Multiple Access Control (I)
Performance Evaluation and Improvement of an Ad Hoc Wireless Network Takayuki Yamamoto Graduate School of Engineering Science, Osaka University, Japan.
1 Y-MAC: An Energy-efficient Multi-channel MAC Protocol for Dense Wireless Sensor Networks Youngmin Kim, Hyojeong Shin, and Hojung Cha International Conference.
Venkatesh Rajendran, Katia Obraczka, J.J. Garcia-Luna-Aceves
Project Introduction 이 상 신 Korea Electronics Technology Institute.
1 Adaptive QoS Framework for Wireless Sensor Networks Lucy He Honeywell Technology & Solutions Lab No. 430 Guo Li Bin Road, Pudong New Area, Shanghai,
Stochastic sleep scheduling (SSS) for large scale wireless sensor networks Yaxiong Zhao Jie Wu Computer and Information Sciences Temple University.
LECTURE9 NET301. DYNAMIC MAC PROTOCOL: CONTENTION PROTOCOL Carrier Sense Multiple Access (CSMA): A protocol in which a node verifies the absence of other.
November 4, 2003APOC 2003 Wuhan, China 1/14 Demand Based Bandwidth Assignment MAC Protocol for Wireless LANs Presented by Ruibiao Qiu Department of Computer.
Dynamic Source Routing (DSR) Sandeep Gupta M.Tech - WCC.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
Presenter: Abhishek Gupta Dept. of Electrical and Computer Engineering
جلسه یازدهم شبکه های کامپیوتری به نــــــــــــام خدا.
Collision-free Time Slot Reuse in Multi-hop Wireless Sensor Networks
1 Delay Aware Link Scheduling for Multi- Hop TDMA Wireless Networks Petar Djukic * and Shahrokh Valaee + *University of California +University of Toronto,
STUMP: Exploiting Position Diversity in the Staggered TDMA Underwater MAC Protocol Kurtis Kredo II, Petar Djukic, Prasant Mohapatra IEEE INFOCOM 2009.
MMAC: A Mobility- Adaptive, Collision-Free MAC Protocol for Wireless Sensor Networks Muneeb Ali, Tashfeen Suleman, and Zartash Afzal Uzmi IEEE Performance,
Self Organization and Energy Efficient TDMA MAC Protocol by Wake Up for Wireless Sensor Networks Zhihui Chen and Ashfaq Khokhar ECE Department, University.
Token-DCF, COMSNET(2013) -> MOBICOM(2014). Introduction ▣ To improve standard MAC protocol of IEEE for WLAN. ▣ S-MAC, A-MAC, SPEED-MAC, and etc.
Opportunistic Flooding in Low-Duty- Cycle Wireless Sensor Networks with Unreliable Links Shuo Goo, Yu Gu, Bo Jiang and Tian He University of Minnesota,
Dynamic TDMA slot assignment in ad hoc networks AINA 2003 Akimitsu KANZAKI, Toshiaki UEMUKAI, Takahiro HARA, Shojiro NISHIO.
Forwarding Group Multicast Protocol (FGMP) for Multihop, Mobile Wireless Networks Speaker : Wilson Lai Date : Ching-Chuan Chiang, Mario Gerla.
A+MAC: A Streamlined Variable Duty-Cycle MAC Protocol for Wireless Sensor Networks 1 Sang Hoon Lee, 2 Byung Joon Park and 1 Lynn Choi 1 School of Electrical.
A Multi-Channel Cooperative MIMO MAC Protocol for Wireless Sensor Networks(MCCMIMO) MASS 2010.
LECTURE9 NET301 11/5/2015Lect 9 NET DYNAMIC MAC PROTOCOL: CONTENTION PROTOCOL Carrier Sense Multiple Access (CSMA): A protocol in which a node verifies.
Utilization Based Duty Cycle Tuning MAC Protocol for Wireless Sensor Networks Shih-Hsien Yang, Hung-Wei Tseng, Eric Hsiao-Kuang Wu, and Gen-Huey Chen Computer.
Mitigating starvation in Wireless Ad hoc Networks: Multi-channel MAC and Power Control Adviser : Frank, Yeong-Sung Lin Presented by Shin-Yao Chen.
CS541 Advanced Networking 1 Contention-based MAC Protocol for Wireless Sensor Networks Neil Tang 4/20/2009.
A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.
An adaptive Multihop Clustering Scheme for Highly Mobile Ad Hoc Networks Tomoyuki Ohta, Shinji Inoue, and Yoshiaki Kakuda ISADS 2003.
Energy-Efficient, Application-Aware Medium Access for Sensor Networks Venkatesh Rajenfran, J. J. Garcia-Luna-Aceves, and Katia Obraczka Computer Engineering.
實驗三 媒體存取協定模擬 教師: 助教: 1998/10/19 High Speed Network Lab. Department of Computer Information Science, NCTU.
Performance Improvement in Ad hoc Wireless Networks with Consideration to Packet Duplication Takayuki Yamamoto Department of Informatics and Mathematical.
1 Grid-Based Access Scheduling for Mobile Data Intensive Sensor Networks C.-K. Lin, V. Zadorozhny and P. Krishnamurthy IEEE International Conference on.
Carrier Sense Multiple Access Improve ALOHA by using carrier sense –Stations listen to the carrier before transmitting –If channel is busy, the station.
Fair and Efficient multihop Scheduling Algorithm for IEEE BWA Systems Daehyon Kim and Aura Ganz International Conference on Broadband Networks 2005.
SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.
A Bit-Map-Assisted Energy- Efficient MAC Scheme for Wireless Sensor Networks Jing Li and Georgios Y. Lazarou Department of Electrical and Computer Engineering,
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
2005/8/2NTU NSLAB1 Self Organization and Energy Efficient TDMA MAC Protocol by Wake Up for Wireless Sensor Networks Zhihui Chen and Ashfag Khokhar ECE/CS.
Oregon Graduate Institute1 Sensor and energy-efficient networking CSE 525: Advanced Networking Computer Science and Engineering Department Winter 2004.
A Low Interference Channel Assignment Algorithm for Wireless Mesh Networks Can Que 1,2, Xinming Zhang 1, and Shifang Dai 1 1.Department of Computer Science.
LA-MAC: A Load Adaptive MAC Protocol for MANETs IEEE Global Telecommunications Conference(GLOBECOM )2009. Presented by Qiang YE Smart Grid Subgroup Meeting.
The “New Network Node” Algorithm Brought to you by: Brian Wolf(Researcher) Harlan Russell (Advisor) Joe Hammond (Advisor Emeritus) Vivek Mehta(Graduate.
AN EFFICIENT TDMA SCHEME WITH DYNAMIC SLOT ASSIGNMENT IN CLUSTERED WIRELESS SENSOR NETWORKS Shafiq U. Hashmi, Jahangir H. Sarker, Hussein T. Mouftah and.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
CT301 LECTURE 8.
Dynamic TDMA Slot Assignment in Ad Hoc Network
SENSYS Presented by Cheolki Lee
Net301 lecture9 11/5/2015 Lect 9 NET301.
Scheduling Mechanism in IEEE e
Date Submitted: [November 9, 2009]
November 2008 Project: IEEE P Working Group for Wireless Personal Area Networks (WPANs) Submission Title: [Distributed channel hopping MAC for industrial.
Subject Name: Adhoc Networks Subject Code: 10CS841
Presentation transcript:

An Adaptive TDMA Slot Assignment Protocol in Ad Hoc Sensor Networks Akimitsu Kanzaki, Takahiro Hara and Shojiro Nishio ACM Symposium on Applied Computing, 2005 (ACM SAC’05)

2 Outline Introduction Related Work  USAP(Unifying Slot Assignment Protocol)  USAP-MA(USAP-Multiple Access)  ASAP(Asaptive Slot Assignment Protocol) E-ASAP (Extend ASAP) Simulation Results Conclusion

3 Introduction Motivation  E-ASAP prevents the excessive increase of unassigned slots By minimizing each node’s frame length.

4 Related Work- USAP(Unifying Slot Assignment Protocol) MILCOM’96 N frames=Cycle M slots The first slot in each frame is reserved to transmit control packet

5 Related Work- USAP(Unifying Slot Assignment Protocol) When a new node joins the network  It firstly collects NMOPs by listening the network channel for a cycle  It recognizes the slot assignments in its contention area. Disadvantage of USAP  N(frame) and M(slot) should be large enough  The channel utilization usually becomes low Due to a large number of unassigned slots. MILCOM’96

6 Related Work- USAP-MA(USAP-Multiple Access) MILCOM’99 Frame Length= 8 Frame Length= 4 Frame Length= 8 Frame Length= 4 Double frame length

7 Related Work- USAP-MA(USAP-Multiple Access) Advantage of USAP-MA  USAP-MA improves the channel utilization By reducing unassigned slots with consideration of the number of nodes and the network topology. Disadvantage of USAP-MA  The channel utilization is still low Unassigned slots in the later part if frame when frame length is double  USAP-MA does not offer When and how to change the frame length How to select a slot assigned to a new node MILCOM’99 Frame Length= 8 Frame Length= 4

8 Related Work- ASAP(Asaptive Slot Assignment Protocol) Set the frame length for a new node  Base on the number of nodes in its contention area  Minimize the number of unassigned slots to improve the channel utilization Packet Format  Transmit mode Data packet (DAT)  Contain the information on the frame length and slots assigned to the sender  Maximum frame length of the sender and its neighbor AINA 2003

9 Related Work- ASAP(Asaptive Slot Assignment Protocol) Packet Format  Control mode Request packet (REQ)  A requests the information on the frame length and assigned slots of all nodes in its contention area. Information packet (INF)  Contain the information on the frame length of B and slots assigned to the sender and C Suggestion packet (SUG)  A sends to its neighbors to announce the frame length and its assigned slot. Reply packet (REP)  B transmits to confirm of receiving SUG AINA 2003 A C B New node 1 3 REQ INF

10 Related Work- ASAP(Asaptive Slot Assignment Protocol) Packet Format  Control mode Request packet (REQ)  A requests the information on the frame length and assigned slots of all nodes in its contention area. Information packet (INF)  Contain the information on the frame length of B and slots assigned to the sender and C Suggestion packet (SUG)  A sends to its neighbors to announce the frame length and its assigned slot. Reply packet (REP)  B transmits to confirm of receiving SUG AINA 2003 A C B New node 1 3 SUG REP

11 Related Work- ASAP(Asaptive Slot Assignment Protocol) Setting the frame length and grasping slot assignment  After collecting INFs from all neighbors, new node sets its frame length. New node adopts the maximum frame length among all nodes in the contention area AINA 2003 Frame Length= 8 Frame Length= 4

12 Related Work- ASAP(Asaptive Slot Assignment Protocol) Selecting an assigned slot  Getting an unassigned slot (GU)  Releasing multiple assigned slots (RMA)  Doubling the frame (DF) 1a 2b 3d 4c 5a 6b 7e Double

13 Related Work- ASAP(Asaptive Slot Assignment Protocol) Disadvantage of ASAP  Frame length in the whole network tends to increase Frame length of a new node is set as the maximum frame length among nodes in its contention area.

14 E-ASAP (Extend ASAP) Each node assigns a slot to itself in the frame of the minimum length Frame Length= 8 Frame Length= 4 h c f d g i 1 j

15 E-ASAP (Extend ASAP) Information held by node h in E-ASAP h 1 hop2 hop

16 Slot Assignment E-ASAP (Extend ASAP)- Slot Assignment Steps:  New node collects INFs transmitted by its neighbors Try to assign a slot to itself in the minimum frame length of 4 slots  New node searches a slot  Getting an unassigned slot (GU)  If the first slot is not assigned to any neighbors, and some unassigned slots are found.  Releasing multiple assigned slots (RMA)  If the first slot is not assigned to any neighbors and all the other slots are assigned to other nodes in its contention area  Doubling the frame (DF)  If no slot is available in the current frame length, new node doubles the frame and tries again to assign a slot  RMA and GU ab Unassigned slot abcdabe Multiple slots

17 E-ASAP (Extend ASAP) New node 1/8 3/4 0/4 2/4 1/4 a b cd e Double 2/8, 6/8RMA b New node GU

18 Detecting of conflict E-ASAP (Extend ASAP)- Detecting of conflict a b c d e fg New node conflict

19 Solution to solve conflict E-ASAP (Extend ASAP)- Solution to solve conflict Deleting a conflicting slot Divide the assignment Delete slot 3 of a Divide slots

20 Frame Length= 8 Solution to solve conflict E-ASAP (Extend ASAP)- Solution to solve conflict Doubling the frame and dividing the assignment Frame Length= 8 Frame Length= 4 Double

21 Releasing Slot Assignment E-ASAP (Extend ASAP)- Releasing Slot Assignment When a node exits from the network  It releases slots assigned to itself, and its neighbors detect the exit  After reconfiguring the slot assignment information The neighbors of the exiting node temporarily release their own assigned slots And search for slots that can be assigned to themselves by Getting an unassigned slot (GU)  If a neighbor finds a slot which can assign to itself in the shorter frame than the current one It updates its own assignment  Each neighbor updates its own assignment transmits in its contention area.

22 Simulation E-ASAP (Extend ASAP)- Simulation Simulation Environment  Each node in the network does not move.  Initially 2 nodes, and this number increases one by one until 50 nodes are present. The number of nodes then decreases one by one in the reverse order  ASAP and E-ASAP New node listens to the channel for 128 slots for collecting information  USAP: frame length 50 slots

23 Simulation E-ASAP (Extend ASAP)- Simulation Average channel utilization

24 Simulation E-ASAP (Extend ASAP)- Simulation Control traffic

25 Simulation E-ASAP (Extend ASAP)- Simulation Setting delay (control mode changes to transmit mode)

26 Conclusion E-ASAP (Extend ASAP)- Conclusion E-ASAP is a TDMA slot assignment protocol  To improve the channel utilization.  To decreases the number of unassigned slots  Efficiently assign slots to nodes When a node appears and disappears from the network Future Work  To consider a frame format to accommodate the movement of nodes.  To extend E-ASAP to adapt the change of network environment Such as traffic load

27