File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.3969/j.issn.1001-2400.2013.01.011
- Scopus: eid_2-s2.0-84875065053
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Article: Routing algorithm based on ant colony optimization in the dual-channel wireless sensor network
Title | Routing algorithm based on ant colony optimization in the dual-channel wireless sensor network |
---|---|
Authors | |
Keywords | Combination optimization Dual-channel wireless sensor network Layered-graph model The infection sphere |
Issue Date | 2013 |
Citation | Xi'an Dianzi Keji Daxue Xuebao/Journal of Xidian University, 2013, v. 40, n. 1 How to Cite? |
Abstract | A combination optimization routing algorithm (CORA) based on the ant colony optimization in dual-channel wireless sensor network is presented to put down the blocking probability of high load network. This algorithm deals with the date collision and multicast suppression in the channel competitive process well by the dual-channel communication model. At the same time, this algorithm uses the infection sphere to reduce the number of nodes which join in researching the optimization route from the source node to the target node, and thus can reduce energy consumption of the network. Finally, this paper proposes a combination optimal routing algorithm with a layered-graph model. The service blocked in the control plane can use the idle resource in the data plane for transmission in a synchronous manner, so the blocking probability of networks and the delay of communication can be cut down in this way. Simulation results show that this algorithm performs better in terms of the time consumption of communication and the total energy consumption. The blocking probability of networks can be cut down 13% compared with the EEABR and EEAWSN. |
Persistent Identifier | http://hdl.handle.net/10722/265649 |
ISSN | 2023 SCImago Journal Rankings: 0.212 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Liu, Kui | - |
dc.contributor.author | Liu, Sanyang | - |
dc.contributor.author | Jiao, Hehua | - |
dc.date.accessioned | 2018-12-03T01:21:17Z | - |
dc.date.available | 2018-12-03T01:21:17Z | - |
dc.date.issued | 2013 | - |
dc.identifier.citation | Xi'an Dianzi Keji Daxue Xuebao/Journal of Xidian University, 2013, v. 40, n. 1 | - |
dc.identifier.issn | 1001-2400 | - |
dc.identifier.uri | http://hdl.handle.net/10722/265649 | - |
dc.description.abstract | A combination optimization routing algorithm (CORA) based on the ant colony optimization in dual-channel wireless sensor network is presented to put down the blocking probability of high load network. This algorithm deals with the date collision and multicast suppression in the channel competitive process well by the dual-channel communication model. At the same time, this algorithm uses the infection sphere to reduce the number of nodes which join in researching the optimization route from the source node to the target node, and thus can reduce energy consumption of the network. Finally, this paper proposes a combination optimal routing algorithm with a layered-graph model. The service blocked in the control plane can use the idle resource in the data plane for transmission in a synchronous manner, so the blocking probability of networks and the delay of communication can be cut down in this way. Simulation results show that this algorithm performs better in terms of the time consumption of communication and the total energy consumption. The blocking probability of networks can be cut down 13% compared with the EEABR and EEAWSN. | - |
dc.language | eng | - |
dc.relation.ispartof | Xi'an Dianzi Keji Daxue Xuebao/Journal of Xidian University | - |
dc.subject | Combination optimization | - |
dc.subject | Dual-channel wireless sensor network | - |
dc.subject | Layered-graph model | - |
dc.subject | The infection sphere | - |
dc.title | Routing algorithm based on ant colony optimization in the dual-channel wireless sensor network | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.3969/j.issn.1001-2400.2013.01.011 | - |
dc.identifier.scopus | eid_2-s2.0-84875065053 | - |
dc.identifier.volume | 40 | - |
dc.identifier.issue | 1 | - |
dc.identifier.spage | null | - |
dc.identifier.epage | null | - |
dc.identifier.issnl | 1001-2400 | - |