CN104796958B - Based on the media access control method of the wireless sensor network of Quorum system - Google Patents

Based on the media access control method of the wireless sensor network of Quorum system Download PDF

Info

Publication number
CN104796958B
CN104796958B CN201510108392.8A CN201510108392A CN104796958B CN 104796958 B CN104796958 B CN 104796958B CN 201510108392 A CN201510108392 A CN 201510108392A CN 104796958 B CN104796958 B CN 104796958B
Authority
CN
China
Prior art keywords
node
base station
group
ring number
oneself
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201510108392.8A
Other languages
Chinese (zh)
Other versions
CN104796958A (en
Inventor
龙军
刘安丰
何岸
张金焕
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Central South University
Original Assignee
Central South University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Central South University filed Critical Central South University
Priority to CN201510108392.8A priority Critical patent/CN104796958B/en
Publication of CN104796958A publication Critical patent/CN104796958A/en
Application granted granted Critical
Publication of CN104796958B publication Critical patent/CN104796958B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/02—Power saving arrangements
    • H04W52/0203—Power saving arrangements in the radio access network or backbone network of wireless communication networks
    • H04W52/0206—Power saving arrangements in the radio access network or backbone network of wireless communication networks in access points, e.g. base stations
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/02—Power saving arrangements
    • H04W52/0209—Power saving arrangements in terminal devices
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/02—Power saving arrangements
    • H04W52/0209—Power saving arrangements in terminal devices
    • H04W52/0212—Power saving arrangements in terminal devices managed by the network, e.g. network or access point is master and terminal is slave
    • H04W52/0216—Power saving arrangements in terminal devices managed by the network, e.g. network or access point is master and terminal is slave using a pre-established activity schedule, e.g. traffic indication frame
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Abstract

The invention discloses a kind of media access control method of the wireless sensor network based on Quorum system, in the method, the time is divided into time slot, and n time slot (slot) forms one-period.The present invention devises F-group and G-group, F-group or G-group choose certain time slot according to its design formula respectively, does is sensor node, in these selected time slots work, called Quorum? Time? Slot (QTS), and in other time slot sleep do not selected to save energy.Does each node of sensor network select F-to roll into a ball or G-group according to the ring number of its place ring, be in the sensor selection problem F-group of odd loop, and in the sensor selection problem G-group of even loop, formation is based on FG like this? the MAC protocol of Quorum system.Prove through theory analysis, the present invention is based on FG? the media access control method of Quorum system has less network delay, can improve the throughput of network.

Description

Based on the media access control method of the wireless sensor network of Quorum system
Technical field
The present invention relates to wireless communication field, especially a kind of medium access control (mediumaccesscontrol, MAC) method of wireless sensor network.
Background technology
Wireless sensor network is each other by wireless network that multi-hop wireless link and the sensor node communicated are formed in the mode of self-organizing and multi-hop by a large amount of, and the energy supply of wireless senser is often by battery as its energy, so how Appropriate application and distribute energy consumption and seem most important.
Medium access control (mediumaccesscontrol, MAC) agreement is a kind of basic agreement in wireless sensor network.Its effect reduces energy ezpenditure while of being and ensureing the normal data manipulation of node and environmental monitoring as much as possible, thus maximization network life.In wireless sensor network, in order to the energy ezpenditure reducing node adopts a kind of method to be allow node periodically work (work) and sleep (sleep) usually.Due to transducer device node in running order time energy ezpenditure be that when being in sleep state upper 100 times even go up 1000 times.Thus in order to save energy, should node be allowed as much as possible to be in sleep state.But node is in sleep can affect its function, because node can not carry out perception and monitoring to surrounding environment when sleep state, transfer of data can not be carried out.Particularly in distributed wireless sensor network, each node independently determines whether work or sleep.This just likely causes node when for carrying out transfer of data, and the working time slot that is in of node makes its data can not onwards transmission with the not crossing time slot (intersectionslot) of the working time slot of its all next-hop node.Particularly in duty ratio, (dactylus o'clock is in the time of work and the ratio of work period length within a time cycle, dutycycle), in smaller network, between any two nodes that ensure adjacent routed path, there is the important topic that crossing working time slot is the design of sensor network medium access protocal.The working time slot of sensor node is more, then the working time slot intersected between node is more, but the working time slot of node is more, then the energy ezpenditure of node is larger, affects network life.Otherwise, reduce the duty ratio of node, although can energy be saved, likely cause the working time slot not having between node to intersect, thus cause route not set up.And on the other hand, in the situation that the duty ratio of node is determined, the method difference of different sensor selection problem working time slot also affects the performance of the medium access protocol of node.The quantity that bad node working time slot system of selection can cause internodal crossing working time slot not etc., does not affect transmission and the network delay of data.Thus, designing outstanding node working time slot system of selection is a challenging task.
System based on Quorum provides a kind of method of medium access protocol.Maximum method is wherein a kind of gridQuorum method.In gridQuorum method, one-period is divided into n time slot (slot), and time slot is the base unit of time.N time slot is aligned in chronological order matrix.Node A selects m wherein 1row time slot is as working time slot, and node keeps operating state (being called QuorumTimeSlot (QTS)) on these time slots selected.And the m in Node B selection matrix 2row are as working time slot.Such node A and Node B must have m 1× m 2individual crossing working time slot (intersectionslot).Thus can ensure to carry out data communication between node A and Node B.The target of obvious Quorum system makes any 2 internodal crossing working time slots more, and the duty ratio of node is less.
But this Quorum system because of nodes all in network be all select m 1row and m 2row, thus cause the Quorum selected between node to be homogeneity, like this, the working time slot of sensor selection problem may be identical, thus when causing data to transmit, conflict increases, and intersect working time slot and reduce, transfer delay increases.
Summary of the invention
The invention provides a kind of media access control method of the wireless sensor network based on Quorum system, can network delay be reduced, improve the life-span of sensor network.
For achieving the above object, the invention provides a kind of media access control method of the wireless sensor network based on Quorum system, comprise the steps:
Step one, formation node ring number, the ring number of oneself is set to 0 by base-station node, and the jumping figure of each node arrival base station is exactly the ring number of node, and the node that node ring number is identical is called the node of same ring;
Step 2, node select F-group or G-group according to the ring number at oneself place, and whole like this network node all have selected oneself working time slot, and the node of the different rings of whole network just defines quorum system;
Step 3, when node has data to send, just initiate data sending request to via node when must wait until that node is working time slot, if there is via node to be also just in time positioned at operating state, then carry out data route.
The invention has the beneficial effects as follows: the present invention selects different groups according to the ring number at node place, thus make the working time slot of the sensor selection problem of different rings be not identical, thus the quantity of Data Concurrent simultaneously can be increased, the throughput of network can be improved, indirectly decrease transfer delay, improve the life-span of sensor network.
Accompanying drawing explanation
Fig. 1 is embodiment of the present invention FGQuorum system localizer interval and working time slot schematic diagram.
Fig. 2 is embodiment of the present invention F-group, G-group and FGquorum system works time slot schematic diagram.
Fig. 3 is the network structure of the embodiment of the present invention.
Fig. 4 is that FGQuorum system parameters m1 and m2 affects schematic diagram to network sensitiveness.
Fig. 5 is that FGQuorum system parameters m1 and m2 affects schematic diagram to crossing working time slot.
Embodiment
Below in conjunction with accompanying drawing and example, the present invention will be further described.
The present embodiment, Quorum system refers to: for given positive integer n, and a universal set U={0,1 ..., n-1}, and Q={Q 1, Q 2... .Q q, namely Q is the subset set of U, and Q iit is an element of Q.If meet the common factor of any 2 elements of Q not for empty, namely then Q is claimed to be universal set U={0,1 ..., a Quorum system under n-1}.
The F-group (p, m) (F (p, m)) of design is: for given positive integer n, and a universal set U={0,1 ..., n-1}. makes f-group is expressed as F (p, m) as shown in the formula shown in 1:
F ( p , m ) = { ( i n + 2 m + p + j ) ( mod n ) : i = 0 , .. m - 1 , j = 0 , .. n - 1 } - - - ( 1 )
Such as: work as n=16, F (2,2)=6,7,8,9,10,11,12,13}, as shown in Fig. 1 and Fig. 2 (a).
The G-group (q, m) (G (q, m)) of design is: for given positive integer n, and a universal set U={0,1 ..., n-1}. makes 0≤q≤n-1.G-group is expressed as G (q, m) as shown in the formula shown in 2::
G ( q , m ) = { ( j n + i m + q ) ( mod n ) : i = 0 , .. m - 1 , j = 0 , .. n - 1 } - - - ( 2 )
Such as: work as n=16, G-group (4,1)={ 0,4,8,12}, as shown in Fig. 1 and Fig. 2 (b).
FGquorum system FG (p, q, m 1, m 2) be designed to: for given positive integer m 1, m 2, p, q, 1≤m 1, q≤n-1.S and T is universal set U={0,1 ..., two nonvoid subsets under n-1}, if S is F (p, a m 1) group, and T is a G (q, m 2) (otherwise or), so (S, T) is just called FGquorum system FG (p, q, m 1, m 2).
Such as: work as n=16, F-group (2,2) and G-group (4,1) just form FG-grid (2,4,2,1), as shown in Fig. 1 and Fig. 2 (c).
The node of odd loop and the node of even loop are route and upstream-downstream relationship when transfer of data.And they select F-to roll into a ball to roll into a ball must form FG (p, q, m with G-respectively 1, m 2).The FG (p, q, the m that form 1, m 2) system has following character:
(a) F (p, m 1)-in have individual element (namely have selected individual working time slot, also referred to as QuorumTimeSlot).
(b) G (p, m 2)-in have individual element (namely individual QuorumTimeSlot).
C any two nodes in () different rings form FG (p, q, m 1, m 2) must m be had 1× m 2individual crossing time slot (intersectionslot).
In the present embodiment, sensor node deployments all in wireless sensor network is in a border circular areas, and base-station node is positioned at border circular areas center, and as shown in Figure 3, the distribution of all the sensors node meets the homogeneous Poisson distribution that node density is ρ.
Step 1: the formation of node ring number.First, the ring number of oneself is set to 0 by base-station node, and the ring number of oneself is set to infinity by other node.Then, oneself is outwards broadcasted to the jumping figure (0) arriving base station in base station, after node listens within the scope of base station broadcast to the broadcast of base station, compared with the jumping figure of the current arrival base station of preserving with oneself after the jumping arriving base station in broadcast is added 1, if the jumping figure arriving base station in broadcast adds the jumping figure that 1 is less than the arrival base station that oneself is preserved, then the ring number oneself being arrived base station is updated in broadcast the jumping figure arriving base station and adds 1.Node after each renewal broadcasts the jumping figure of the arrival base station after renewal subsequently.Above process goes on always, until the jumping figure that node arrives base station no longer upgrades.At this moment, each node arrives the ring number that the jumping figure of base station is exactly node.The node that node ring number is identical is called the node of same ring;
Form the donut around base station as shown in Figure 3.What distance base station was nearest is first ring.
Step 2: the sensor selection problem G-group in odd loop, selects the working time slot of oneself according to formula 2.Such as: work as n=16, G-group (4,1)=0,4,8,12}, and namely the 0th, 4,8,12 time slots are working time slot, and node is in running order at these time slots, and is in sleep state at other time slot, as shown in Fig. 2 (b).
Sensor selection problem F-group in even loop, selects the working time slot of oneself according to formula 1.Such as: work as n=16, F (2,2)={ 6,7,8,9,10,11,12,13}, namely the 6th, 7,8,9,10,11,12,13 time slots are working time slot, and node is in running order at these time slots, and is in sleep state at other time slot, as shown in Fig. 2 (a).
Whole like this network node all have selected oneself working time slot, and the node of the different rings of whole network just defines Quorum system.As shown in Figure 3, the sensor selection problem G-group of first ring, represents with G1 in the drawings, and the sensor selection problem F-group of the 2nd ring, because it is first F-group, therefore represents with F1 in Fig. 3.The rest may be inferred, forms G2, F2, G3, F3.And two of arbitrary neighborhood rings must form FGQuorum system.
Step 3: when node has data to send, just initiates data sending request to via node when must wait until that node is working time slot, if there is via node to be also just in time positioned at operating state, then carries out data route.The FGQuorum system that the present invention proposes ensures must have m within the one-period time 1× m 2individual crossing time slot (intersectionslot).Thus can ensure that data must obtain the chance of transmission in one-period.
The invention provides a kind of medium access control (mediumaccesscontrol, MAC) method of the wireless sensor network based on Quorum system, by allowing the node of different rings select F-to roll into a ball and G-group respectively, forming FG (p, q, m 1, m 2).To than Quorum system in the past, the invention has the advantages that:
(1) the present invention devises F-group and G-group, by allowing the sensor node of different rings select F-to roll into a ball or G-group respectively, thus forms FGQuorum system.To than the MAC protocol based on Quorum in the past, have the following advantages: in the past based in Quorum system, in network, all nodes are all select m 1row and m 2row, thus cause the Quorum selected between node to be homogeneity, like this, the working time slot of sensor selection problem may be identical, thus when causing data to transmit, conflict increases.And FGQuorum system of the present invention selects different groups according to the ring number at node place, thus make the working time slot of the sensor selection problem of different rings be not identical, thus the quantity of Data Concurrent simultaneously can be increased, thus the throughput of network can be improved, thus indirectly decrease transfer delay.
(2) the FGQuorum system that the present invention proposes has the performance higher with Quorum system in the past, different rings selects F-to roll into a ball respectively or G-group makes the node between different rings have more crossing working time slot, when making node need to transmit data like this, find the probability of the next-hop node being positioned at working time slot state higher, thus can network delay be reduced.
(3) duty ratio of the FGQuorum system of setting the present invention to propose is as ε, and for the node of kth ring, its relaying collector node number is υ.(set of relay nodes of set of relay nodes (ForwardersSet, FS) node A refers within the scope of transmission half r of node A, and those nodes set of the ring number of node less than node A 1.Obviously, the FS of the 1st link point only has base-station node.In figure 3, the FS of node A is node D, E, F, G, H, I. and the FS of Node B is node C).Then adopt the inventive method, the average retardation that data forward forward through this kth link point is:
d > 1 = Σ i = 1 n - 1 iD s = Σ i = 1 ( 1 - ϵ ) n - 1 ( i ϵ ( 1 - ϵ ) ( i - 1 ) P k ) + Σ i = ( 1 - ϵ ) n n - 1 ( i ( 1 - ϵ ) ( 1 - ϵ ) n P k ) + n ( 1 - P k ) - - - ( 3 )
| P k = n ( 1 - ( 1 - ϵ ) υ ) ( ρπr 2 ) μ k , u k = δ × n × B k t B τ + δ × n × B k r B τ
Wherein, the time span of B is the number of data transfers unit of node to be bps, τ a be time slot, unit is second, and δ is the size of packet, and unit is bits. λ is that data produce speed, refers in a time slot τ, produce λ data. the data volume that kth link point needs to send in one-period, it is the data volume that kth link point receives in one-period.
For verifying feasibility and the high efficiency of the inventive method, we have carried out theory analysis to the agreement proposed, and obtain the experimental result of Fig. 4 and Fig. 5.Fig. 4 gives the impact to network sensitiveness (network sensitiveness (networksensibility) is defined as the maximum timeslot number between two crossing working time slots, and its performance of less explanation is better) when to select different parameters m1 and m2 in FG-gridQuorum system.Visible, when m1 and m2 is larger, its network sensitiveness is less.Parameter m1 and the m2 that Fig. 5 provides is on the impact of crossing working time slot quantity.In FGQuorum system, intersecting working time slot quantity is m1 × m2, and according to the research that we are current, this is the best result that current best Quorum system can reach.

Claims (2)

1. based on a media access control method for the wireless sensor network of Quorum system, it is characterized in that, comprise the steps:
Step one, formation node ring number, the ring number of oneself is set to 0 by base-station node, and the minimum hop count that other each nodes arrive base stations is exactly the ring number of node, and the node that node ring number is identical is called the node of same ring;
Step 2, node select F-group or G-group according to the ring number n at oneself place, if the ring number of node is odd number, select F-group, are expressed as F (p, m), as shown in the formula
F ( p , m ) = { ( i n + 2 m + p + j ) ( mod n ) : i = 0 , .. m - 1 , j = 0 , .. n - 1 }
Wherein, 1 ≤ m ≤ n , 0 ≤ p ≤ n - 1 ;
If the ring number of node is even number, select G-group, be expressed as G (q, m), as shown in the formula
G ( q , m ) = { ( j n + i m + q ) ( mod n ) : i = 0 , .. m - 1 , j = 0 , .. n - 1 }
Wherein 0≤q≤n-1; Whole like this network node all have selected oneself working time slot, and the node of the different rings of whole network just defines quorum system;
Step 3, when node has data to send, just initiate data sending request to via node when must wait until that node is working time slot, if there is via node to be also just in time positioned at operating state, then carry out data route.
2. the media access control method of the wireless sensor network based on Quorum system according to claim 1, it is characterized in that, the concrete steps forming node ring number in step one are: first, the ring number of oneself is set to 0 by base-station node, the ring number of oneself is set to infinity by other node, then, oneself is outwards broadcasted to the jumping figure 0 arriving base station in base station, after node listens within the scope of base station broadcast to the broadcast of base station, compared with the jumping figure of the current arrival base station of preserving with oneself after the jumping arriving base station in broadcast is added 1, if the jumping figure arriving base station in broadcast adds the jumping figure that 1 is less than the arrival base station that oneself is preserved, the ring number then oneself being arrived base station is updated in broadcast the jumping figure arriving base station and adds 1, node after each renewal broadcasts the jumping figure of the arrival base station after renewal subsequently, above process goes on always, until the jumping figure that node arrives base station no longer upgrades, at this moment, the jumping figure of each node arrival base station is exactly the ring number of node, and the node that node ring number is identical is called the node of same ring.
CN201510108392.8A 2015-03-12 2015-03-12 Based on the media access control method of the wireless sensor network of Quorum system Active CN104796958B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510108392.8A CN104796958B (en) 2015-03-12 2015-03-12 Based on the media access control method of the wireless sensor network of Quorum system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510108392.8A CN104796958B (en) 2015-03-12 2015-03-12 Based on the media access control method of the wireless sensor network of Quorum system

Publications (2)

Publication Number Publication Date
CN104796958A CN104796958A (en) 2015-07-22
CN104796958B true CN104796958B (en) 2016-04-20

Family

ID=53561370

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510108392.8A Active CN104796958B (en) 2015-03-12 2015-03-12 Based on the media access control method of the wireless sensor network of Quorum system

Country Status (1)

Country Link
CN (1) CN104796958B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106656904B (en) * 2015-10-28 2020-03-03 北京京东振世信息技术有限公司 Method and device for realizing permission data cache synchronization based on Quorum mechanism

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101252603A (en) * 2008-04-11 2008-08-27 清华大学 Cluster distributed type lock management method based on storage area network SAN
CN103188736A (en) * 2013-04-12 2013-07-03 南京熊猫电子制造有限公司 ANT node power energy-saving method based on flow control
CN103338502A (en) * 2013-06-09 2013-10-02 中国科学院信息工程研究所 Sensor node neighbor discovering method and system

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101252603A (en) * 2008-04-11 2008-08-27 清华大学 Cluster distributed type lock management method based on storage area network SAN
CN103188736A (en) * 2013-04-12 2013-07-03 南京熊猫电子制造有限公司 ANT node power energy-saving method based on flow control
CN103338502A (en) * 2013-06-09 2013-10-02 中国科学院信息工程研究所 Sensor node neighbor discovering method and system

Also Published As

Publication number Publication date
CN104796958A (en) 2015-07-22

Similar Documents

Publication Publication Date Title
Tong et al. LEACH-B: an improved LEACH protocol for wireless sensor network
Awwad et al. Cluster based routing protocol for mobile nodes in wireless sensor network
CN102291448B (en) Automatic IP (Internet protocol) address allocation method based on geographical position in mobile ad hoc network
Cao et al. Robust multi-pipeline scheduling in low-duty-cycle wireless sensor networks
Gambhir et al. Op-LEACH: an optimized LEACH method for busty traffic in WSNs
CN103533595A (en) Multi-hop clustering routing algorithm (GEEMHCR) for wireless sensor networks
Tong et al. A pipelined-forwarding, routing-integrated and effectively-identifying MAC for large-scale WSN
CN101801113B (en) Network topology cluster processing method and processing system
CN102083164A (en) Method for opportunistic routing of wireless sensor network (WSN) based on energy perception
CN104796958B (en) Based on the media access control method of the wireless sensor network of Quorum system
CN102378285A (en) Method for solving packet space transmission problem of multi-channel wireless sensor network
CN104703273B (en) A kind of synchronous wireless sensor network MAC method of Quorum time slot self-adaptative adjustment
Alnawafa et al. EDMHT-LEACH: Enhancing the performance of the DMHT-LEACH protocol for wireless sensor networks
Zytoune et al. A fairly balanced clustering algorithm for routing in wireless sensor networks
CN101471864A (en) Data forwarding method based on receiver route in wireless self-organizing network
Moussaoui et al. A novel clustering algorithm for efficient energy saving in wireless sensor networks
Zidi et al. MC-UWMAC: A multi-channel MAC protocol for underwater sensor networks
Chang et al. An energy conservation MAC protocol in wireless sensor networks
Pan An improved the DSR routing protocol in mobile ad hoc networks
Dolev et al. Bounded-hop energy-efficient liveness of flocking swarms
Swain et al. Adv-MMAC: An advertisement based multichannel MAC protocol for wireless sensor networks
Raja et al. Performance analysis of Self-organized Tree Based Energy Balance (STEB) routing protocol for WSN
Aby et al. Asynchronous blind MAC protocol for wireless sensor networks
Chaitra et al. Energy efficient mac and routing protocols–a survey
Chaudhary et al. Performance optimization of WSN using deterministic energy efficient clustering protocol: A review

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
EXSB Decision made by sipo to initiate substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant