‫ﻣﺴﻴﺮﻳﺎﺑﯽ ﻣﺒﺘﻨﯽ ﺑﺮ ﻗﻴﻤﺖﮔﺬﺍﺭﯼ ﺩﺭ ﺷﺒﮑﻪﻫﺎﯼ ﻣﻮﺭﺩﯼ ﺳﻴّﺎﺭ‬
‫ﻣﮋﮔﺎﻥ ﺧﺎﻟﺪﯼ‬
‫ﺩﺍﻧﺸﮑﺪﻩ ﻣﻬﻨﺪﺳﯽ ﮐﺎﻣﭙﻴﻮﺗﺮ‬
‫ﺩﺍﻧﺸﮕﺎﻩ ﺻﻨﻌﺘﯽ ﺷﺮﻳﻒ‬
‫‪[email protected]‬‬
‫ﭼﮑﻴﺪﻩ‪ .‬ﺷﺒﮑﻪﻫﺎﯼ ﻣﻮﺭﺩﯼ ﺳﻴّﺎﺭ‪ ،‬ﻣﺠﻤﻮﻋﻪﺍﯼ ﺍﺯ ﮔﺮﻩﻫﺎﯼ ﻣﺘﺤّﺮﮎ ﺳﻴّﺎﺭ ﻫﺴﺘﻨﺪ ﮐﻪ ﺑﺪﻭﻥ ﺑﻬﺮﻩﮔﻴﺮﯼ ﺍﺯ ﻫﻴﭻ‬
‫ﺳﺎﺧﺘﺎﺭ ﺍﺯ ﭘﻴﺶ ﺗﻨﻈﻴﻢ ﺷﺪﻩﺍﯼ ﺷﺒﮑﻪ ﺧﻮﺩ ﺭﺍ ﺑﺮﭘﺎ ﻣﯽﮐﻨﻨﺪ‪ .‬ﺭﻭﺵﻫﺎﯼ ﻣﺴﻴﺮﻳﺎﺑﯽ ﻣﺨﺘﻠﻔﯽ ﺑﺮﺍﯼ ﺍﻳﻦ ﺷﺒﮑﻪﻫﺎ‬
‫ﭘﻴﺸﻨﻬﺎﺩ ﺷﺪﻩﺍﺳﺖ‪ .‬ﺍﻏﻠﺐ ﺭﻭﺵﻫﺎﯼ ﺍﺭﺍﺋﻪ ﺷﺪﻩ‪ ،‬ﺑﺎ ﻓﺮﺽ ﻫﻤﮑﺎﺭﯼ ﺑﺪﻭﻥ ﺷﺮﻁ ﮔﺮﻩﻫﺎﯼ ﻣﻴﺎﻧﯽ ﺩﺭ ﺍﺭﺳﺎﻝ ﺑﺴﺘﻪﻫﺎ‬
‫ﻼ‬
‫ﺑﻪ ﮔﺮﻩﻫﺎﯼ ﺩﻳﮕﺮ ﺍﺳﺖ‪ .‬ﺍﻣﺎ ﺩﺭ ﺷﺒﮑﻪﻫﺎﯼ ﻣﻮﺭﺩﯼ ﺳﻴّﺎﺭ ﺑﺪﻟﻴﻞ ﺧﻮﺩﻣﺨﺘﺎﺭﯼ ﮔﺮﻩﻫﺎﯼ ﻣﺘﺤّﺮﮎ‪ ،‬ﺭﻓﺘﺎﺭﻫﺎﯼ ﮐﺎﻣ ً‬
‫ﻭﺍﺑﺴﺘﻪ ﺑﻪ ﻫﻤﮑﺎﺭﯼ ﻭﺟﻮﺩ ﻧﺪﺍﺭﺩ‪ .‬ﻳﮏ ﺭﺍﻫﮑﺎﺭ ﺑﺮﺍﯼ ﺍﻳﺠﺎﺩ ﺍﻧﮕﻴﺰﻩ ﻫﻤﮑﺎﺭﯼ ﺩﺭ ﮔﺮﻩﻫﺎﯼ ﻣﺘﺤّﺮﮎ‪ ،‬ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ‬
‫ﺭﻭﺵﻫﺎﯼ ﻣﺒﺘﻨﯽ ﺑﺮ ﻗﻴﻤﺖﮔﺬﺍﺭﯼ ﺍﺳﺖ‪ .‬ﺩﺭ ﺍﻳﻦ ﻣﻘﺎﻟﻪ ﺭﻭﺵﻫﺎﯼ ﻣﺴﻴﺮﻳﺎﺑﯽ ﻣﺒﺘﻨﯽ ﺑﺮ ﻗﻴﻤﺖﮔﺬﺍﺭﯼ ﺑﺮﺭﺳﯽ‬
‫ﺧﻮﺍﻫﺪ ﺷﺪ‪.‬‬
‫ﻭﺍﮊﻩﻫﺎﯼ ﻛﻠﻴﺪﻱ‪ :‬ﺷﺒﮑﻪﻫﺎﯼ ﻣﻮﺭﺩﯼ ﺳﻴّﺎﺭ‪ ،‬ﻣﺴﻴﺮﻳﺎﺑﯽ‪ ،‬ﻗﻴﻤﺖﮔﺬﺍﺭﯼ‪ ،‬ﻧﻈﺮﻳﻪ ﺑﺎﺯﯼﻫﺎ‪.‬‬
‫‪ 1‬ﻣﻘﺪﻣﻪ‬
‫ﺷﺒﮑﻪﻫﺎﯼ ﻣﻮﺭﺩﯼ ﺳﻴّﺎﺭ‪ ،1‬ﺷﺒﮑﻪﻫﺎﯼ ﭼﻨﺪﮔﺎﻣﯽ ﻫﺴﺘﻨﺪ ﮐﻪ ﺗﻮﺳﻂ ﻣﺠﻤﻮﻋﻪﺍﯼ ﺍﺯ ﮔﺮﻩﻫﺎﯼ ﺳﻴّﺎﺭ‪ ،‬ﺑﺪﻭﻥ ﻧﻴﺎﺯ ﺑﻪ ﻣﺪﻳﺮﻳﺖ‬
‫ﻣﺮﮐﺰﯼ ﻭ ﺯﻳﺮﺳﺎﺧﺘﯽ ﺛﺎﺑﺖ‪ ،‬ﺍﻳﺠﺎﺩ ﻣﯽﺷﻮﻧﺪ‪ .‬ﺩﺭ ﺍﻳﻦ ﺷﺒﮑﻪﻫﺎ ﮔﺮﻩﻫﺎﯼ ﻣﺘﺤّﺮﮎ ﻣﯽ ﺗﻮﺍﻧﻨﺪ ﺑﺎ ﮔﺮﻩﻫﺎﻳﯽ ﮐﻪ ﺩﺭ ﺑﺮﺩ‬
‫ﻣﺨﺎﺑﺮﺍﺗﯽ ﺁﻧﻬﺎ ﻧﻴﺴﺘﻨﺪ‪ ،‬ﺍﺯ ﻃﺮﻳﻖ ﻫﻤﮑﺎﺭﯼ ﮔﺮﻩﻫﺎﯼ ﻣﺘﺤّﺮﮎ ﺑﺮﺍﯼ ﺍﺭﺳﺎﻝ ﺑﺴﺘﻪﻫﺎ ﺑﻪﻳﮑﺪﻳﮕﺮ‪ ،‬ﺍﺭﺗﺒﺎﻁ ﺑﺮﻗﺮﺍﺭ ﮐﻨﻨﺪ‪ .‬ﺩﺭ‬
‫ﺷﺮﺍﻳﻂ ﻧﻈﺎﻣﯽ ﻳﺎ ﺍﺿﻄﺮﺍﺭﯼ‪ ،‬ﮔﺮﻩﻫﺎﯼ ﻣﺘﺤّﺮﮎ ﻫﺪﻑ ﻳﮑﺴﺎﻧﯽ ﺩﺍﺭﻧﺪ‪ .‬ﺩﺭ ﺍﻳﻦ ﺷﺮﺍﻳﻂ ﮔﺮﻩﻫﺎﯼ ﻣﺘﺤّﺮﮎ ﺑﺮﺍﯼ ﺍﻓﺰﺍﻳﺶ‬
‫ﮐﺎﺭﺍﻳﯽ ﮐﻞ ﺳﻴﺴﺘﻢ ﺑﺎ ﻳﮑﺪﻳﮕﺮ ﻫﻤﮑﺎﺭﯼ ﻣﯽ ﮐﻨﻨﺪ ﻭ ﺑﺪﻭﻥ ﻫﻴﭻ ﭘﻴﺶ ﺷﺮﻃﯽ ﺑﺴﺘﻪ ﻫﺎ ﺭﺍ ﺑﻪﻳﮑﺪﻳﮕﺮ ﺍﺭﺳﺎﻝ ﻣﯽ ﮐﻨﻨﺪ‪ .‬ﺍﻣﺎ‬
‫ﻼ ﺧﻮﺩ‬
‫ﺩﺭ ﮐﺎﺭﺑﺮﺩﻫﺎﯼ ﻏﻴﺮ ﻧﻈﺎﻣﯽ‪ ،‬ﺍﺯ ﺁﻧﺠﺎﻳﯽ ﮐﻪ ﮔﺮﻩﻫﺎﯼ ﻣﺘﺤّﺮﮎ ﻣﻌﻤﻮ ًﻻ ﻫﺪﻑ ﻳﮑﺴﺎﻧﯽ ﺭﺍ ﺩﻧﺒﺎﻝ ﻧﻤﯽﮐﻨﻨﺪ ﻭ ﮐﺎﻣ ً‬
‫ﻣﺨﺘﺎﺭ‪ 2‬ﻫﺴﺘﻨﺪ‪ .‬ﻟﺬﺍ ﻧﻤﯽﺗﻮﺍﻥ ﻫﻤﮑﺎﺭﯼ ﮔﺮﻩﻫﺎﯼ ﻣﺘﺤّﺮﮎ ﻣﺎﻧﻨﺪ ﻓﺮﺳﺘﺎﺩﻥ ﺑﺪﻭﻥ ﺷﺮﻁ ﺑﺴﺘﻪﻫﺎ ﺑﻪ ﮔﺮﻩﻫﺎﯼ ﺩﻳﮕﺮ ﺭﺍ ﺩﺭ‬
‫ﻧﻈﺮ ﮔﺮﻓﺖ‪ .‬ﺩﺭ ﺍﻳﻦ ﺣﺎﻟﺖ ﮔﺮﻩﻫﺎﯼ ﻣﺘﺤّﺮﮎ ﺧﻮﺩﺧﻮﺍﻫﺎﻧﻪ ﻋﻤﻞ ﻣﯽﮐﻨﻨﺪ‪ .‬ﺍﻳﻦ ﺷﺒﮑﻪﻫﺎ ﺭﺍ ﺷﺒﮑﻪﻫﺎﯼ ﺧﻮﺩﻣﺨﺘﺎﺭ ﻣﻮﺭﺩﯼ‬
‫ﺳﻴّﺎﺭ ﻣﯽﻧﺎﻣﻴﻢ‪.‬‬
‫‪Mobile Ad Hoc Networks‬‬
‫‪Self Organized‬‬
‫‪1‬‬
‫‪2‬‬
‫ﺩﻭ ﺭﻭﺵ ﺑﺮﺍﯼ ﺷﺒﻴﻪﺳﺎﺯﯼ ﻫﻤﮑﺎﺭﯼ ﺑﻴﻦ ﮔﺮﻩﻫﺎﯼ ﺧﻮﺩﺧﻮﺍﻩ ﭘﻴﺸﻨﻬﺎﺩ ﺷﺪﻩﺍﺳﺖ‪-۱ .‬ﺭﻭﺵﻫﺎﯼ ﻣﺒﺘﻨﯽ ﺑﺮ ﺍﻋﺘﺒﺎﺭ‪-٢ 3‬‬
‫ﺭﻭﺵﻫﺎﯼ ﻣﺒﺘﻨﯽ ﺑﺮ ﻗﻴﻤﺖﮔﺬﺍﺭﯼ‪ .4‬ﺩﺭ ﺭﻭﺵﻫﺎﯼ ﻣﺒﺘﻨﯽ ﺑﺮ ﺍﻋﺘﺒﺎﺭ‪ ،‬ﮔﺮﻩ ﻣﺘﺤّﺮﮎ ﺑﺮ ﭘﺎﻳﻪ ﺭﻓﺘﺎﺭ ﮔﺬﺷﺘﻪﺍﺵ ﺗﻌﻴﻴﻦ ﻣﯽ‪-‬‬
‫ﮐﻨﺪ ﮐﻪ ﺑﺎﻳﺪ ﺑﺴﺘﻪ ﺭﺍ ﺑﻪ ﺩﻳﮕﺮ ﮔﺮﻩﻫﺎ ﺑﻔﺮﺳﺘﺪ ﻭﻳﺎ ﺍﺯ ﺩﻳﮕﺮ ﮔﺮﻩﻫﺎ ﺩﺭﺧﻮﺍﺳﺖ ﮐﻨﺪ ﮐﻪ ﺑﺴﺘﻪ ﺑﻔﺮﺳﺘﻨﺪ‪ .‬ﺩﺭ ﺍﻳﻦ ﺭﻭﻳﻪ ﺑﺎ‬
‫ﻣﺪﻳﺮﻳﺖ ﮐﺮﺩﻥ ﻓﻌﺎﻟﻴﺖﻫﺎﯼ ﻣﺮﺑﻮﻁ ﺑﻪ ﺍﺭﺳﺎﻝ ﺑﺴﺘﻪﻫﺎ‪ ،‬ﮔﺮﻩﻫﺎﻳﯽ ﮐﻪ ﺭﻓﺘﺎﺭ ﻧﺎﻣﻨﺎﺳﺐ ﺩﺍﺭﻧﺪ‪ ،‬ﺷﻨﺎﺧﺘﻪ ﻣﯽﺷﻮﻧﺪ ﻭ ﺍﺯ ﺑﻘﻴﻪ‬
‫ﺷﺒﮑﻪ ﺟﺪﺍ ﻣﯽﺷﻮﻧﺪ‪ .‬ﺩﺭ ﺭﻭﺵﻫﺎﯼ ﻣﺒﺘﻨﯽ ﺑﺮ ﻗﻴﻤﺖ ﮔﺬﺍﺭﯼ‪ ،‬ﮔﺮﻩﻫﺎﯼ ﺧﻮﺩﺧﻮﺍﻩ‪ ،‬ﺑﻪ ﺷﺮﻁ ﺁﻧﮑﻪ ﺑﺘﻮﺍﻧﻨﺪ ﭘﻮﻟﯽ‪ ،‬ﺍﺯ‬
‫ﺩﺭﺧﻮﺍﺳﺖ ﮐﻨﻨﺪﻩﻫﺎ ﺑﻪ ﺟﺒﺮﺍﻥ ﻓﺮﺳﺘﺎﺩﻥ ﺑﺴﺘﻪﻫﺎ ﺩﺭﻳﺎﻓﺖ ﮐﻨﻨﺪ‪ ،‬ﺑﺴﺘﻪﻫﺎ ﺭﺍ ﺑﻪ ﺩﻳﮕﺮ ﮔﺮﻩﻫﺎ ﻣﯽ ﻓﺮﺳﺘﻨﺪ‪ .‬ﺩﺭ ﺍﻳﻦ ﻣﻘﺎﻟﻪ‬
‫ﺭﻭﺵﻫﺎﯼ ﻣﺒﺘﻨﯽ ﺑﺮ ﻗﻴﻤﺖﮔﺬﺍﺭﯼ ﺑﺮﺭﺳﯽ ﺧﻮﺍﻫﺪ ﺷﺪ‪.‬‬
‫ﺩﺭ ﺍﺩﺍﻣﻪ ﺍﻳﻦ ﻣﻘﺎﻟﻪ‪ ،‬ﺩﺭ ﺑﺨﺶ ‪ 2‬ﭼﻨﺪ ﺭﻭﺵ ﻣﺴﻴﺮ ﻳﺎﺑﯽ ﻣﺒﺘﻨﯽ ﺑﺮ ﻗﻴﻤﺖﮔﺬﺍﺭﯼ ﺭﺍ ﺑﺮﺭﺳﯽ ﻣﯽ ﺷﻮﺩ‪ .‬ﺩﺭ ﺑﺨﺶ ﻧﻴﺰ ‪3‬‬
‫ﻧﺘﻴﺠﻪ ﮔﻴﺮﯼ ﺑﻴﺎﻥ ﻣﯽﺷﻮﺩ‪.‬‬
‫‪ 2‬ﺭﻭﺵﻫﺎﯼ ﻣﺴﻴﺮﻳﺎﺑﯽ ﻣﺒﺘﻨﯽ ﺑﺮ ﻗﻴﻤﺖﮔﺬﺍﺭﯼ‬
‫‪Sprite5 1.2‬‬
‫ﺩﺭ ]‪ [7‬ﻳﮏ ﺳﻴﺴﺘﻢ ﺳﺎﺩﻩ‪ ،‬ﺻﺎﺩﻗﺎﻧﻪ ﻭ ﻣﺒﺘﻨﯽ ﺑﺮ ﺍﻋﺘﺒﺎﺭ ﺑﺮﺍﯼ ﺷﺒﮑﻪﻫﺎﯼ ﻣﻮﺭﺩﯼ ﺳ ّﻴﺎﺭ ﺑﻪ ﻧﺎﻡ ‪ Sprite‬ﺍﺭﺍﺋﻪ ﺷﺪﻩ ﺍﺳﺖ‪ .‬ﺩﺭ‬
‫ﺤﺮﮎ ﺑﻪ ﻣﻨﻈﻮﺭ ﺷﺮﮐﺖ ﺩﺭ ﺍﺭﺳﺎﻝ ﺑﺴﺘﻪﻫﺎ ﺍﺳﺘﻔﺎﺩﻩ ﻣﯽﺷﻮﺩ‪ .‬ﺩﺭ‬
‫ﺍﻳﻦ ﺳﻴﺴﺘﻢ ﺍﺯ ﺍﻋﺘﺒﺎﺭ ﺑﺮﺍﯼ ﺍﻳﺠﺎﺩ ﺍﻧﮕﻴﺰﻩ ﺩﺭ ﮔﺮﻩﻫﺎﯼ ﻣﺘ ّ‬
‫ﺍﻳﻦ ﺳﻴﺴﺘﻢ ﻭﻗﺘﯽ ﮔﺮﻩﺍﯼ ﺑﺴﺘﻪﺍﯼ ﺭﺍ ﺩﺭﻳﺎﻓﺖ ﻣﯽﮐﻨﺪ‪ ،‬ﺗﺎﺋﻴﺪﻳﻪ ﺩﺭﻳﺎﻓﺖ ﺑﺴﺘﻪ ﺭﺍ ﻧﮕﻪ ﻣﯽﺩﺍﺭﺩ‪ .‬ﺳﭙﺲ ﺗﺎﺋﻴﺪﻳﻪ ﺩﺭﻳﺎﻓﺖ‬
‫ﺑﺴﺘﻪﻫﺎ ﻭﻳﺎ ﺍﺭﺳﺎﻝ ﺑﺴﺘﻪﻫﺎ ﺭﺍ ﺑﻪ ﺳﺮﻭﻳﺲ ﺗﺴﻮﻳﻪ ﺍﻋﺘﺒﺎﺭ ﻣﺮﮐﺰﯼ‪ ،(CCS) 6‬ﮔﺰﺍﺭﺵ ﻣﯽ ﺩﻫﺪ‪ ،CCS .‬ﺑﺎﺗﻮﺟﻪ ﺑﻪ ﺗﺎﺋﻴﺪﻳﻪ‪-‬‬
‫ﻫﺎﯼ ﺩﺭﻳﺎﻓﺖ ﺷﺪﻩ‪ ،‬ﺑﺮﺍﯼ ﻫﺮ ﮔﺮﻩ ﻫﺰﻳﻨﻪ ﻭ ﺍﻋﺘﺒﺎﺭﯼ ﺭﺍ ﻣﺸﺨﺺ ﻣﯽﮐﻨﺪ‪ .‬ﺯﻣﺎﻧﯽ ﮐﻪ ﮔﺮﻩ ﺑﺴﺘﻪﻫﺎﯼ ﺧﻮﺩﺵ ﺭﺍ ﺍﺭﺳﺎﻝ ﻣﯽ‬
‫ﮐﻨﺪ‪ ،‬ﺍﻋﺘﺒﺎﺭ ﺍﺯ ﺩﺳﺖ ﻣﯽﺩﻫﺪ‪ .‬ﺯﻳﺮﺍ ﮔﺮﻩﻫﺎﯼ ﻣﻴﺎﻧﯽ ﻭﺍﻗﻊ ﺩﺭ ﻣﺴﻴﺮ ﺍﺭﺳﺎﻝ ﺑﺴﺘﻪﻫﺎﯼ ﮔﺮﻩﯼ ﻓﺮﺳﺘﻨﺪﻩ‪ ،‬ﻫﺰﻳﻨﻪﺍﯼ ﺭﺍ ﺑﺮﺍﯼ‬
‫ﺍﺭﺳﺎﻝ ﺍﻳﻦ ﺑﺴﺘﻪﻫﺎ ﻣﺘﺤﻤﻞ ﻣﯽﺷﻮﻧﺪ‪ .‬ﺑﻨﺎﺑﺮﺍﻳﻦ ﮔﺮﻩﯼ ﻓﺮﺳﺘﻨﺪﻩ ﺑﺎﻳﺪ ﺑﺮﺍﯼ ﺍﺭﺳﺎﻝ ﺑﺴﺘﻪﻫﺎﻳﺶ ﺑﻪ ﮔﺮﻩﻫﺎﯼ ﻣﻴﺎﻧﯽ ﻫﺰﻳﻨﻪﺍﯼ‬
‫ﭘﺮﺩﺍﺧﺖ ﮐﻨﺪ‪ ،CCS .‬ﻫﺰﻳﻨﻪ ﻓﺮﺳﺘﻨﺪﻩ ﺭﺍ ﺑﺮﺍﺳﺎﺱ ﺗﻌﺪﺍﺩ ﺗﺎﺋﻴﺪﻳﻪﻫﺎﯼ ﺩﺭﻳﺎﻓﺘﯽ ﻭ ﺗﻌﺪﺍﺩ ﮔﺮﻩﻫﺎﯼ ﻣﻴﺎﻧﯽ ﺗﺎ ﻣﻘﺼﺪ ﻣﺤﺎﺳﺒﻪ‬
‫ﻣﯽﮐﻨﺪ‪ .‬ﺑﺮﺍﯼ ﺗﺎﻣﻴﻦ ﺍﻳﻦ ﻫﺰﻳﻨﻪ‪ ،‬ﮔﺮﻩ ﻓﺮﺳﺘﻨﺪﻩ ﺑﺎﻳﺪ ﺩﺭ ﺍﺭﺳﺎﻝ ﺑﺴﺘﻪﻫﺎﯼ ﻧﻴﻤﯽ ﺍﺯ ﮔﺮﻩﻫﺎﯼ ﺩﻳﮕﺮ ﺷﺮﮐﺖ ﮐﻨﺪ‪ .‬ﺩﺭ ﺍﻳﻦ‬
‫ﺳﻴﺴﺘﻢ ﮔﺮﻩﻫﺎﯼ ﺧﻮﺩﺧﻮﺍﻩ ﻣﻤﮑﻦ ﺍﺳﺖ ﻳﮑﯽ ﺍﺯ ﺭﻓﺘﺎﺭﻫﺎﯼ ﺧﻮﺩﺧﻮﺍﻫﺎﻧﻪ ﺯﻳﺮ ﺭﺍ ﺍﻧﺠﺎﻡ ﺩﻫﻨﺪ‪.‬‬
‫‪ -۱‬ﭘﺲ ﺍﺯ ﺩﺭﻳﺎﻓﺖ ﺑﺴﺘﻪ‪ ،‬ﮔﺮﻩ ﺗﺎﺋﻴﺪﻳﻪ ﺭﺍ ﻧﮕﻪ ﻣﯽﺩﺍﺭﺩ‪ .‬ﺍﻣﺎ ﺑﺴﺘﻪ ﺭﺍ ﺍﺭﺳﺎﻝ ﻧﻤﯽﮐﻨﺪ‪.‬‬
‫‪ -٢‬ﮔﺮﻩ ﺑﺴﺘﻪ ﺭﺍ ﺩﺭﻳﺎﻓﺖ ﻣﯽﮐﻨﺪ‪ ،‬ﺍﻣﺎ ﺗﺎﺋﻴﺪﻳﻪ ﺩﺭﻳﺎﻓﺖ ﺑﺴﺘﻪ ﺭﺍ ﮔﺰﺍﺭﺵ ﻧﻤﯽ ﮐﻨﺪ‪.‬‬
‫‪ -٣‬ﮔﺮﻩ ﺑﺴﺘﻪ ﺭﺍ ﺩﺭﻳﺎﻓﺖ ﻧﮑﺮﺩﻩ‪ ،‬ﺍﻣﺎ ﺑﻪ ﺩﺭﻭﻍ ﺍﻋﻼﻡ ﻣﯽﮐﻨﺪ ﮐﻪ ﺑﺴﺘﻪ ﺭﺍ ﺩﺭﻳﺎﻓﺖ ﮐﺮﺩﻩ ﺍﺳﺖ‪.‬‬
‫ﺩﺭ ]‪ [7‬ﭼﻨﺪ ﺗﮑﻨﻴﮏ ﺑﺮﺍﯼ ﺟﻠﻮﮔﻴﺮﯼ ﺍﺯ ﭼﻨﻴﻦ ﺭﻓﺘﺎﺭﻫﺎﻳﯽ ﺑﻴﺎﻥ ﺷﺪﻩﺍﺳﺖ‪ .‬ﮐﻪ ﺩﺭ ﺍﺩﺍﻣﻪ ﺑﻪ ﺑﺮﺭﺳﯽ ﺁﻧﻬﺎ ﻣﯽﭘﺮﺩﺍﺯﻳﻢ‪.‬‬
‫ﺑﺮﺍﯼ ﺍﻳﺠﺎﺩ ﺍﻧﮕﻴﺰﻩ ﺩﺭ ﮔﺮﻩﻫﺎﯼ ﺧﻮﺩﺧﻮﺍﻩ ﺑﺮﺍﯼ ﺍﺭﺳﺎﻝ ﺑﺴﺘﻪﻫﺎﯼ ﺳﺎﻳﺮ ﮔﺮﻩﻫﺎ‪ CCS ،‬ﺑﺎﻳﺪ ﺍﻋﺘﺒﺎﺭ ﺑﻴﺸﺘﺮﯼ ﺑﻪ ﮔﺮﻩﻫﺎﻳﯽ ﮐﻪ‬
‫ﺑﺴﺘﻪﻫﺎﯼ ﺩﻳﮕﺮ ﮔﺮﻩﻫﺎ ﺭﺍ ﺍﺭﺳﺎﻝ ﻣﯽﮐﻨﻨﺪ ﻧﺴﺒﺖ ﺑﻪ ﮔﺮﻩﻫﺎﻳﯽ ﮐﻪ ﺑﺴﺘﻪﻫﺎﯼ ﺩﻳﮕﺮ ﮔﺮﻩﻫﺎ ﺭﺍ ﺍﺭﺳﺎﻝ ﻧﻤﯽﮐﻨﻨﺪ‪ ،‬ﺑﺪﻫﺪ‪ .‬ﺍﺑﺘﺪﺍ‬
‫‪3‬‬
‫‪Reputation- Based‬‬
‫‪Pricing-Based‬‬
‫‪5 A Simple, Cheat-proof, Credit-Based System for Mobile Ah-hoc Networks‬‬
‫‪6 Centralized Credit Clearance Service‬‬
‫‪4‬‬
‫‪ ،CCS‬ﺁﺧﺮﻳﻦ ﮔﺮﻩﺍﯼ ﺩﺭ ﻣﺴﻴﺮ ﮐﻪ ﺑﺴﺘﻪ ﺭﺍ ﺩﺭﻳﺎﻓﺖ ﮐﺮﺩﻩﺍﺳﺖ ﺭﺍ ﻣﺸﺨﺺ ﻣﯽ ﮐﻨﺪ‪ .‬ﺳﭙﺲ ‪ ،CCS‬ﺍﺯ ﻓﺮﺳﺘﻨﺪﻩ ﻣﯽ‬
‫ﺧﻮﺍﻫﺪ ﮐﻪ ﺑﻪ ﺍﻧﺪﺍﺯﻩ ‪ β‬ﺑﻪ ﺍﻳﻦ ﮔﺮﻩ ﻭ ‪ α‬ﺑﻪ ﺗﻤﺎﻡ ﮔﺮﻩﻫﺎﯼ ﻗﺒﻞ ﺍﺯ ﺍﻳﻦ ﮔﺮﻩ ﭘﺮﺩﺍﺧﺖ ﮐﻨﺪ) ‪.( α>β‬‬
‫ﻫﺮ ﮔﺮﻩﺍﯼ ﮐﻪ ﺑﺴﺘﻪﺍﯼ ﺭﺍ ﺩﺭﻳﺎﻓﺖ ﻣﯽﮐﻨﺪ‪ ،‬ﻋﻼﻗﻪﻣﻨﺪ ﺍﺳﺖ ﮐﻪ ﺗﺎﺋﻴﺪﻳﻪ ﺩﺭﻳﺎﻓﺖ ﺑﺴﺘﻪ ﺭﺍ ﺑﻪ ‪ CCS‬ﮔﺰﺍﺭﺵ ﺩﻫﺪ‪ .‬ﺯﻳﺮﺍ‬
‫ﺍﻋﺘﺒﺎﺭﯼ ﮐﻪ ﺩﺭﻳﺎﻓﺖ ﻣﯽﮐﻨﺪ ﺑﻴﺶ ﺍﺯ ﻫﺰﻳﻨﻪ ﮔﺰﺍﺭﺵ ﺩﺍﺩﻥ ﺗﺎﺋﻴﺪﻳﻪ ﺩﺭﻳﺎﻓﺖ ﺑﺴﺘﻪ ﺍﺳﺖ‪ .‬ﺑﺎ ﺍﻳﻦ ﻭﺟﻮﺩ ﺷﺮﺍﻳﻄﯽ ﻭﺟﻮﺩ‬
‫ﺩﺍﺭﺩﮐﻪ ﮔﺮﻩ ﺗﻤﺎﻳﻠﯽ ﺑﻪ ﮔﺰﺍﺭﺵ ﺩﺍﺩﻥ ﺗﺎﺋﻴﺪﻳﻪ ﺩﺭﻳﺎﻓﺖ ﺑﺴﺘﻪ ﻧﺪﺍﺭﺩ‪ .‬ﺑﺮﺍﯼ ﻣﺜﺎﻝ ﺁﺧﺮﻳﻦ ﮔﺮﻩﺍﯼ ) ﺩﺭ ﺣﺎﻟﺖ ﮐﻠﯽ ‪ k‬ﺍﻣﻴﻦ‬
‫ﮔﺮﻩ ( ﮐﻪ ﺑﺴﺘﻪ ﺭﺍ ﺩﺭﻳﺎﻓﺖ ﻣﯽﮐﻨﺪ‪ ،‬ﻣﯽﺗﻮﺍﻧﺪ ﺑﺎ ﻓﺮﺳﺘﻨﺪﻩ ﺗﺒﺎﻧﯽ ﮐﻨﺪ ﻭ ﺩﺭﻳﺎﻓﺖ ﺑﺴﺘﻪ ﺭﺍ ﮔﺰﺍﺭﺵ ﻧﺪﻫﺪ‪ .‬ﺩﺭ ﺍﻳﻦ ﺣﺎﻟﺖ‬
‫ﻓﺮﺳﺘﻨﺪﻩ ﺑﻪ ﺍﻧﺪﺍﺯﻩﯼ ‪ α‬ﺳﻮﺩ ﻣﯽﮐﻨﺪ ﻭ ﺁﺧﺮﻳﻦ ﮔﺮﻩ ﻣﻘﺪﺍﺭ ‪ β‬ﺭﺍ ﺍﺯ ﺩﺳﺖ ﻣﯽ ﺩﻫﺪ‪ .‬ﺍﮔﺮ ﻓﺮﺳﺘﻨﺪﻩ ﺑﻪ ﺍﻧﺪﺍﺯﻩﯼ ‪ε) β + ε‬‬
‫<‪ (0‬ﺑﻪ ﺁﺧﺮﻳﻦ ﮔﺮﻩ ﺍﻋﺘﺒﺎﺭ ﺑﺪﻫﺪ‪ .‬ﺑﺎﺯﻫﻢ ﻓﺮﺳﺘﻨﺪﻩ ﺑﻪ ﺍﻧﺪﺍﺯﻩﯼ )‪ ،α -(β + ε‬ﺳﻮﺩ ﻣﯽﮐﻨﺪ‪ .‬ﺑﺮﺍﯼ ﺟﻠﻮﮔﻴﺮﯼ ﺍﺯ ﭼﻨﻴﻦ‬
‫ﺭﻓﺘﺎﺭﯼ ‪ CCS‬ﻣﻘﺪﺍﺭ ‪ k) kβ‬ﺗﻌﺪﺍﺩ ﮔﺮﻩﻫﺎﻳﯽ ﻫﺴﺘﻨﺪ ﮐﻪ ﺩﺭﻳﺎﻓﺖ ﺑﺴﺘﻪ ﺭﺍ ﮔﺰﺍﺭﺵ ﻧﺪﺍﺩﻩﺍﻧﺪ( ﺭﺍ ﺑﻪ ﻫﺰﻳﻨﻪ ﻓﺮﺳﺘﻨﺪﻩ ﺍﺿﺎﻓﻪ‬
‫ﻣﯽﮐﻨﺪ‪.‬‬
‫ﺍﮔﺮ ﮔﺮﻩﻫﺎﯼ ﻣﻴﺎﻧﯽ ﺑﻪﺟﺎﯼ ﺍﺭﺳﺎﻝ ﮐﻞ ﺑﺴﺘﻪ ﺗﻨﻬﺎ ﺗﺎﺋﻴﺪﻳﻪ ﺩﺭﻳﺎﻓﺖ ﺑﺴﺘﻪ ﺭﺍ ﺍﺭﺳﺎﻝ ﮐﻨﻨﺪ‪ .‬ﺍﻳﻦ ﺍﺭﺳﺎﻝ ﺑﺮﺍﯼ ﺩﺭﻳﺎﻓﺖ‬
‫ﺍﻋﺘﺒﺎﺭ ﺍﺯ ‪ CCS‬ﮐﺎﻓﯽ ﺍﺳﺖ‪ .‬ﺩﺭ ﺍﻳﻦ ﺣﺎﻟﺖ ﮔﺮﻩ ﻣﻘﺼﺪ ﺑﺪﻟﻴﻞ ﻋﺪﻡ ﺩﺭﻳﺎﻓﺖ ﺩﺍﺩﻩﯼ ﺩﺭﺳﺖ‪ ،‬ﺗﺎﺋﻴﺪﻳﻪﯼ ﺩﺭﻳﺎﻓﺖ ﺑﺴﺘﻪ ﺭﺍ‬
‫ﮔﺰﺍﺭﺵ ﻧﻤﯽﺩﻫﺪ‪ .‬ﺑﻪ ﻫﻤﻴﻦ ﺟﻬﺖ ‪ ،CCS‬ﺩﺭ ﺣﺎﻟﺘﯽ ﮐﻪ ﺗﺎﺋﻴﺪﻳﻪ ﺩﺭﻳﺎﻓﺖ ﺑﺴﺘﻪ ﺭﺍ ﺍﺯ ﮔﻴﺮﻧﺪﻩ ﺩﺭﻳﺎﻓﺖ ﻧﮑﻨﺪ‪ ،‬ﺍﻋﺘﺒﺎﺭ ﮔﺮﻩ‪-‬‬
‫ﻫﺎﯼ ﻣﻴﺎﻧﯽ ﺭﺍ ﺩﺭ ‪ γ <1‬ﺿﺮﺏ ﻣﯽﮐﻨﺪ‪ .‬ﺍﻳﻦ ﻋﻤﻞ ﺑﺎﻋﺚ ﮐﺎﻫﺶ ﺍﻋﺘﺒﺎﺭ ﮔﺮﻩﻫﺎﯼ ﻣﻴﺎﻧﯽ ﻣﯽﺷﻮﺩ‪ .‬ﻣﺸﮑﻞ ﺍﺻﻠﯽ ﺍﻳﻦ ﺭﻭﺵ‬
‫ﻧﻴﺎﺯ ﺑﻪ ﺍﺭﺗﺒﺎﻁ ﺳﺮﻳﻊ ﺑﺎ ‪ CCS‬ﺑﻪ ﻣﻨﻈﻮﺭ ﮔﺰﺍﺭﺵ ﺩﺭﻳﺎﻓﺖ ﺑﺴﺘﻪ ﺍﺳﺖ‪.‬‬
‫‪Ad hoc-VCG7 2.2‬‬
‫ﺭﺍﻧﺪﻣﺎﻥ ﺍﻧﺮﮊﯼ ﻳﮑﯽ ﺍﺯ ﭘﺎﺭﺍﻣﺘﺮﻫﺎﯼ ﻣﻬﻢ ﺩﺭ ﭘﺮﻭﺗﮑﻞﻫﺎﯼ ﻣﺴﻴﺮﻳﺎﺑﯽ ﺩﺭ ﺷﺒﮑﻪﻫﺎﯼ ﻣﻮﺭﺩﯼ ﺳﻴّﺎﺭ ﺍﺳﺖ‪ .‬ﺑﺎﻳﺪ ﺍﻃﻤﻴﻨﺎﻥ‬
‫ﺣﺎﺻﻞ ﺷﻮﺩ ﮐﻪ ﮔﺮﻩﻫﺎ ﺩﺭ ﻃﻮﻝ ﻣﺴﻴﺮﯼ ﺑﺎ ﺑﻴﺸﺘﺮﻳﻦ ﺭﺍﻧﺪﻣﺎﻥ ﺍﻧﺮﮊﯼ ﻣﺴﻴﺮﻳﺎﺑﯽ ﻣﯽﺷﻮﻧﺪ‪ .‬ﺍﻧﺮﮊﯼ ﮐﻞ ﻣﺴﻴﺮ ﺑﺮﺍﺑﺮ ﺑﺎ ﺟﻤﻊ‬
‫ﺳﻄﻮﺡ ﺍﻧﺮﮊﯼ ﺍﻧﺘﺸﺎﺭ ﻳﺎﻓﺘﻪ ﺗﻮﺳﻂ ﮔﺮﻩ ﻣﺒﺪﺍ ﻭ ﮔﺮﻩﻫﺎﯼ ﻣﻴﺎﻧﯽ ﺍﺳﺖ‪ .‬ﺍﮔﺮ ﮔﺮﻩﺍﯼ ﺩﺭ ﻣﺴﻴﺮﻳﺎﺑﯽ ﺑﻪ ﺳﻤﺖ ﻣﻘﺼﺪ‪ ،‬ﻣﻴﺎﻧﯽ‪،‬‬
‫ﺍﻧﺘﺨﺎﺏ ﺷﻮﺩ‪ .‬ﺍﺭﺳﺎﻝ ﺑﺴﺘﻪ ﺗﻮﺳﻂ ﺍﻳﻦ ﮔﺮﻩ ﻣﻤﮑﻦ ﺍﺳﺖ ﺑﺎﻋﺚ ﺗﺨﻠﻴﻪ ﺑﺎﺗﺮﯼﺍﺵ ﺷﻮﺩ‪ .‬ﺑﻪ ﻫﻤﻴﻦ ﺟﻬﺖ ﮔﺮﻩ ﺧﻮﺩﺧﻮﺍﻫﺎﻧﻪ‬
‫ﻋﻤﻞ ﻣﯽﮐﻨﺪ ﻭ ﺍﺯ ﺍﺭﺳﺎﻝ ﺑﺴﺘﻪ ﺧﻮﺩﺩﺍﺭﯼ ﻣﯽﮐﻨﺪ‪.‬‬
‫ﺩﺭ]‪ ،Ad hoc-VCG [3‬ﺭﺍﻫﮑﺎﺭﯼ ﻣﺒﺘﻨﯽ ﺑﺮ ﻗﻴﻤﺖ ﮔﺬﺍﺭﯼ‪ ،‬ﺑﺮﺍﯼ ﺣﻞ ﺍﻳﻦ ﻣﺸﮑﻞ ﺍﺭﺍﺋﻪ ﺷﺪﻩ ﺍﺳﺖ‪ .‬ﺩﺭ ﺍﻳﻦ ﺭﻭﺵ‬
‫ﮔﺮﻩﻫﺎﯼ ﻣﻴﺎﻧﯽ ﺑﺮﺍﯼ ﺍﺭﺳﺎﻝ ﺑﺴﺘﻪ ﭘﻮﻝ ﺩﺭﻳﺎﻓﺖ ﻣﯽﮐﻨﻨﺪ ﺗﺎ ﻫﺰﻳﻨﻪﺍﯼ ﺭﺍ ﮐﻪ ﺑﻪ ﺧﺎﻃﺮ ﺍﺭﺳﺎﻝ ﺑﺴﺘﻪ ﻫﺎ ﺑﻪ ﺁﻧﻬﺎ ﺗﺤﻤﻴﻞ‬
‫ﺷﺪﻩﺍﺳﺖ‪ ،‬ﺟﺒﺮﺍﻥ ﻭ ﻋﻼﻭﻩ ﺑﺮ ﺁﻥ ﺳﻮﺩﯼ ﺭﺍ ﻧﻴﺰ ﺑﺪﺳﺖ ﺁﻭﺭﻧﺪ‪ .‬ﺩﺭ ‪ Ad hoc-VCG‬ﻫﺰﻳﻨﻪﯼ ﺍﺭﺳﺎﻝ ﺑﺴﺘﻪ ﺑﻪ ﮐﻤﮏ‬
‫ﭘﺎﺭﺍﻣﺘﺮ ﻫﺰﻳﻨﻪ ﺍﻧﺮﮊﯼ )‪ (c‬ﺗﺨﻤﻴﻦ ﺯﺩﻩ ﻣﯽ ﺷﻮﺩ‪ .‬ﻣﻘﺪﺍﺭ ‪ ci‬ﺑﺮﺣﺴﺐ )‪ $‬ﺑﺮ ﻭﺍﺕ( ﺑﻴﺎﻥ ﻣﯽﺷﻮﺩ‪ .‬ﻭ ﮔﺴﺴﺘﻪ ﺍﺳﺖ‪.‬‬
‫ﺍﮔﺮﻓﺮﺳﺘﺎﺩﻥ ﺑﺴﺘﻪﺍﯼ ﺑﻪ ﺍﻧﺪﺍﺯﻩﯼ ﻭﺍﺣﺪ‪ ،‬ﻧﻴﺎﺯ ﺑﻪ ﺍﻧﺘﺸﺎﺭ ﺳﻴﮕﻨﺎﻟﯽ ﺑﺮﺍﺑﺮ ﺑﺎ ‪) Pemit‬ﻭﺍﺕ( ﺩﺍﺷﺘﻪ ﺑﺎﺷﺪ‪ .‬ﺩﺭ ﺍﻳﻦ ﺣﺎﻟﺖ ﮔﺮﻩ ‪ i‬ﺍﻡ‬
‫ﺩﺭﺧﻮﺍﺳﺖ ﭘﺮﺩﺍﺧﺖ ‪ ،($)Pemit ci‬ﺑﺮﺍﯼ ﺍﺭﺳﺎﻝ ﺑﺴﺘﻪ ﻣﯽﮐﻨﺪ‪ .‬ﺍﮔﺮ ﭘﻮﻝ ﺩﺭﻳﺎﻓﺘﯽ ﻧﺘﻮﺍﻧﺪ ﻫﺰﻳﻨﻪ ﺍﺭﺳﺎﻝ ﺑﺴﺘﻪ ﺭﺍ ﭘﻮﺷﺶ‬
‫ﺩﻫﺪ‪ ،‬ﮔﺮﻩ ﻣﻴﺎﻧﯽ ﺍﺯ ﺍﺭﺳﺎﻝ ﺑﺴﺘﻪ ﺧﻮﺩﺩﺍﺭﯼ ﻣﯽﮐﻨﺪ‪ .‬ﻫﺰﻳﻨﻪﯼ ﺍﻧﺮﮊﯼ‪ ،‬ﭘﺎﺭﺍﻣﺘﺮﯼ ﺗﺎﺑﻊ ﺯﻣﺎﻥ ﺍﺳﺖ ﮐﻪ ﺩﺭ ﺁﻥ ﺍﻟﻮﻳﺖ ﮔﺮﻩﻫﺎ‬
‫ﻣﺎﻧﻨﺪ ﺗﻮﺍﻥ ﺧﻮﺩﻣﺨﺘﺎﺭﯼ ﺩﺭ ﻧﻈﺮ ﮔﺮﻓﺘﻪ ﻣﯽﺷﻮﺩ‪ .‬ﮔﺮﻩﻫﺎ ﺩﺭ ﺍﻳﻦ ﺭﻭﺵ ﺳﻄﺢ ﺍﻧﺮﮊﯼ ﺍﻧﺘﺸﺎﺭﻳﺎﻓﺘﻪ ﺧﻮﺩ ﺭﺍ ﺍﺯ ﻃﺮﻳﻖ ﻓﺮﺁﻳﻨﺪ‬
‫ﻋﻼﻣﺖ ﺩﻫﯽ ﻭ ﻓﻴﻠﺪﻫﺎﯼ ﮐﻨﺘﺮﻟﯽ ﺩﺭ ﺑﺴﺘﻪﻫﺎ ﮔﺰﺍﺭﺵ ﻣﯽﺩﻫﻨﺪ‪ .‬ﻋﻼﻭﻩ ﺑﺮ ﺁﻥ‪ ،‬ﮔﺮﻩ ﺑﺎ ﺩﺭﻳﺎﻓﺖ ﺑﺴﺘﻪ ﺍﺯ ﮔﺮﻩﻫﺎﯼ ﻫﻤﺴﺎﻳﻪ‬
‫ﻣﯽ ﺗﻮﺍﻧﺪ ﺍﺯ ﺍﻧﺮﮊﯼ ﺍﻧﺘﺸﺎﺭﻳﺎﻓﺘﻪ ﺗﻮﺳﻂ ﻫﻤﺴﺎﻳﻪﻫﺎ‪ ،‬ﻣﻄﻠﻊ ﺷﻮﺩ‪ .‬ﺩﺭ ﻧﻬﺎﻳﺖ ﮔﺮﻩﻫﺎ ﺗﻮﺍﻥ ﺍﻧﺘﺸﺎﺭ ﺧﻮﺩ ﺭﺍ ﺗﻨﻈﻴﻢ ﻣﯽﮐﻨﻨﺪ‪.‬‬
‫‪Vickrey-Clarke-Groves‬‬
‫‪7‬‬
‫‪ Ad hoc- VCG‬ﺑﺮ ﺭﻭﯼ ﺍﻟﮕﻮﺭﻳﺘﻢ ﻣﺴﻴﺮﻳﺎﺑﯽ ‪ DSR8‬ﮐﺎﺭ ﻣﯽﮐﻨﺪ ﻭ ﺍﺯ ﺩﻭ ﻣﺮﺣﻠﻪ ﺗﺸﮑﻴﻞ ﺷﺪﻩ ﺍﺳﺖ‪ .‬ﺩﺭ ﻣﺮﺣﻠﻪ‬
‫ﮐﺸﻒ ﻣﺴﻴﺮ‪ ،‬ﮔﺮﺍﻓﯽ ﻭﺯﻥﺩﺍﺭ ﺍﻳﺠﺎﺩ ﻣﯽﺷﻮﺩ‪ .‬ﺩﺭ ﺍﻳﻦ ﮔﺮﺍﻑ ﮔﺮﻩﻫﺎ‪ ،‬ﮔﺮﻩﻫﺎﯼ ﺷﺒﮑﻪ ﻫﺴﺘﻨﺪ‪ .‬ﻭﺯﻥ ﻳﺎﻝﻫﺎ ﺑﺮﺍﺑﺮ ﺑﺎ ﭘﻮﻟﯽ ﺍﺳﺖ‬
‫ﮐﻪ ﮔﺮﻩ ﺑﺎﻳﺪ ﺑﻪ ﺟﻬﺖ ﺍﺭﺳﺎﻝ ﺑﺴﺘﻪ ﺩﺭ ﻃﻮﻝ ﺍﻳﻦ ﻳﺎﻝ‪ ،‬ﺩﺭﻳﺎﻓﺖ ﮐﻨﺪ‪ .‬ﮔﺮﻩ ﻣﻘﺼﺪ ﺗﻤﺎﻡ ﻭﺯﻥﻫﺎﯼ ﻳﺎﻝﻫﺎ ﺭﺍ ﺟﻤﻊ ﺁﻭﺭﯼ ﻣﯽ‪-‬‬
‫ﮐﻨﺪ ﻭ ﺳﭙﺲ ﮐﻮﺗﺎﻩﺗﺮﻳﻦ ﻣﺴﻴﺮ ﺑﻴﻦ ﻣﺒﺪﺍ ﻭ ﻣﻘﺼﺪ ﺭﺍ ﮐﻪ ﺑﺮﺍﺑﺮ ﺑﺎ ﻣﺴﻴﺮﯼ ﺑﺎ ﺑﻴﺸﺘﺮﻳﻦ ﺭﺍﻧﺪﻣﺎﻥ ﺍﻧﺮﮊﯼ ﺍﺳﺖ‪ ،‬ﺍﻧﺘﺨﺎﺏ ﻣﯽ‪-‬‬
‫ﮐﻨﺪ‪ .‬ﺩﺭ ﻣﺮﺣﻠﻪ ﺍﻧﺘﻘﺎﻝ ﺩﺍﺩﻩ‪ ،‬ﺑﺴﺘﻪﻫﺎ ﺩﺭ ﻃﻮﻝ ﮐﻮﺗﺎﻩﺗﺮﻳﻦ ﻣﺴﻴﺮ ﺍﺭﺳﺎﻝ ﻣﯽﺷﻮﻧﺪ ﻭ ﮔﺮﻩﻫﺎﯼ ﻣﻴﺎﻧﯽ ﻫﺰﻳﻨﻪ ﺍﺭﺳﺎﻝ ﺑﺴﺘﻪﻫﺎ‬
‫ﺭﺍ ﺩﺭﻳﺎﻓﺖ ﻣﯽﮐﻨﻨﺪ‪.‬‬
‫ﺩﺭ ﻣﺮﺣﻠﻪ ﮐﺸﻒ ﻣﺴﻴﺮ ﻣﺤﺪﻭﺩﻳﺖﻫﺎﻳﯽ ﻭﺟﻮﺩ ﺩﺍﺭﺩ‪ .‬ﺩﺭ ﺍﻳﻦ ﻣﺮﺣﻠﻪ ﮔﺮﻩﻫﺎ ﺑﺎﻳﺪ ﻗﺪﺭﺕ ﺳﻴﮕﻨﺎﻟﯽ ﺭﺍ ﮐﻪ ﺍﻧﺘﺸﺎﺭ ﻣﯽ‪-‬‬
‫ﺩﻫﻨﺪ ﺭﺍ ﻧﻤﺎﻳﺎﻥ ﺳﺎﺯﻧﺪ‪ .‬ﻫﻤﭽﻨﻴﻦ ﮔﺮﻩﻫﺎ ﺍﻃﻼﻋﺎﺕ ﺭﺍ ﺑﺎ ﺗﻮﺟﻪ ﺑﻪ ﻗﺪﺭﺕ ﺳﻴﮕﻨﺎﻝ ﺩﺭﻳﺎﻓﺘﯽ ﺍﺯ ﻫﻤﺴﺎﻳﻪﻫﺎ ﺍﺭﺳﺎﻝ ﻣﯽﮐﻨﻨﺪ‪.‬‬
‫ﺍﻳﻦ ﻣﺴﺌﻠﻪ ﺯﻣﻴﻨﻪﺍﯼ ﺭﺍ ﺍﻳﺠﺎﺩ ﻣﯽﮐﻨﺪ ﮐﻪ ﮔﺮﻩﻫﺎ ﺩﺭﻭﻍ ﺑﮕﻮﻳﻨﺪ‪ .‬ﺑﺮﺍﯼ ﻣﺜﺎﻝ‪ ،‬ﺍﮔﺮ ﮔﺮﻩ ‪ i‬ﺍﻡ ﺩﺭ ﻫﺰﻳﻨﻪ ﺍﻧﺮﮊﯼﺍﺵ ﻏﻠﻮ ﮐﻨﺪ‪،‬‬
‫ﺍﮔﺮ ﺩﺭ ﮐﻮﺗﺎﻩﺗﺮﻳﻦ ﻣﺴﻴﺮ ﺑﻪ ﺳﻤﺖ ﻣﻘﺼﺪ ﺍﻧﺘﺨﺎﺏ ﺷﻮﺩ‪ ،‬ﭘﻮﻝ ﺑﻴﺸﺘﺮﯼ ﺭﺍ ﺩﺭﻳﺎﻓﺖ ﻣﯽﮐﻨﺪ‪.‬‬
‫ﺑﺮﺍﯼ ﻏﻠﺒﻪ ﺑﺮ ﺍﻳﻦ ﻣﺴﺎﺋﻞ‪ ،Ad hoc-VCG ،‬ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﻣﮑﺎﻧﻴﺰﻳﻢ ‪ VCG‬ﭘﻮﻝ ﺭﺍ ﻃﻮﺭﯼ ﺗﻌﺮﻳﻒ ﻣﯽﮐﻨﺪ ﮐﻪ ﮔﺮﻩ‪-‬‬
‫ﻫﺎ ﺩﺭﻭﻍ ﻧﮕﻮﻳﻨﺪ‪ .‬ﺩﺭ ﺍﻳﻦ ﺭﻭﺵ ﻫﺮ ﮔﺮﻩ ﺍﻧﮕﻴﺰﻩ ﻻﺯﻡ ﺑﺮﺍﯼ ﺁﺷﮑﺎﺭ ﮐﺮﺩﻥ ﻫﺰﻳﻨﻪ ﻭﺍﻗﻌﯽﺍﺵ ﺭﺍ ﺩﺍﺭﺩ‪ .‬ﺩﺭ ]‪ [3‬ﺍﺛﺒﺎﺕ ﺷﺪﻩ ﮐﻪ‬
‫ﺑﺮﺍﯼ ﻫﺮ ﮔﺮﻩ ﺗﻐﻴﻴﺮ ﭘﺎﺭﺍﻣﺘﺮ ﻫﺰﻳﻨﻪ ﺍﻧﺮﮊﯼ ﺳﻮﺩﻣﻨﺪ ﻧﻴﺴﺖ‪ .‬ﺯﻳﺮﺍ ﺩﺭ ﺍﻳﻦ ﺣﺎﻟﺖ ﻫﺰﻳﻨﻪ ﻧﻬﺎﻳﯽ ﺑﻴﺶ ﺍﺯ ﺳﻮﺩﯼ ﺍﺳﺖ ﮐﻪ ﺑﺎ‬
‫ﺗﻐﻴﻴﺮ ﭘﺎﺭﺍﻣﺘﺮ ﻫﺰﻳﻨﻪ ﺍﻧﺮﮊﯼ ﺑﺪﺳﺖ ﻣﯽﺁﻭﺭﺩ‪.‬‬
‫‪ ،Ad hoc-VCG‬ﺯﻣﺎﻧﯽ ﮐﻪ ﺗﻨﻬﺎ ﻳﮏ ﻧﻮﺩ ﺩﺭﻭﻍ ﺑﮕﻮﻳﺪ‪ ،‬ﺧﻮﺏ ﻋﻤﻞ ﻣﯽ ﮐﻨﺪ‪ .‬ﺩﺭ ﺯﻣﺎﻧﯽ ﮐﻪ ﭼﻨﺪ ﮔﺮﻩ ﺑﺮﺍﯼ ﺑﻴﺸﻴﻨﻪ‬
‫ﮐﺮﺩﻥ ﺳﻮﺩ ﺧﻮﺩ ﺑﺎ ﻳﮑﺪﻳﮕﺮ ﺗﺒﺎﻧﯽ ﮐﻨﻨﺪ‪ ،‬ﺍﻳﻦ ﺭﻭﺵ ﺩﭼﺎﺭ ﻣﺸﮑﻞ ﻣﯽﺷﻮﺩ‪ .‬ﻣﺴﺌﻠﻪ ﺩﻳﮕﺮ ﺩﺭ ﺍﻳﻦ ﺭﻭﺵ ﺳﺮﺑﺎﺭ ﺯﻳﺎﺩ ﺁﻥ‬
‫ﺍﺳﺖ‪ .‬ﺍﻳﻦ ﺭﻭﺵ ﻧﻴﺎﺯ ﺑﻪ ﺍﻃﻼﻋﺎﺕ ﮐﺎﻣﻞ ﺍﺯ ﺗﻮﭘﻮﻟﻮﮊﯼ ﺷﺒﮑﻪ ﺑﺮﺍﯼ ﺍﻳﺠﺎﺩ ﮔﺮﺍﻑ ﺩﺍﺭﺩ ﮐﻪ ﺳﺮﺑﺎﺭ ﺯﻳﺎﺩﯼ ﺭﺍ ﺩﺭ ﻣﺮﺣﻠﻪ ﮐﺸﻒ‬
‫ﻣﺴﻴﺮ ﺍﻳﺠﺎﺩ ﻣﯽﮐﻨﺪ‪ .‬ﺩﺭ ﻧﻬﺎﻳﺖ ﺍﻳﻦ ﺭﻭﺵ ﺑﺮ ﭘﺎﻳﻪ ﻫﺮﻳﻨﻪ ﻭﺍﻗﻌﯽ ﻧﻴﺴﺖ ﺑﻠﮑﻪ ﺑﺮ ﭘﺎﻳﻪ ﺗﺨﻤﻴﻦ ﻫﺰﻳﻨﻪ ﺍﺳﺖ‪.‬‬
‫ﺩﺭ ]‪ VCG ،[4‬ﺑﺎ ﺗﮑﻨﻴﮏﻫﺎﯼ ﺍﻣﻨﻴﺘﯽ ﺑﺮﺍﯼ ﺣﻞ ﻣﺴﺌﻠﻪ ﻫﺰﻳﻨﻪ ﺍﺗﺼﺎﻝ ﺗﺮﮐﻴﺐ ﺷﺪﻩﺍﺳﺖ‪ .‬ﺩﺭ ﺍﻳﻦ ﺭﻭﺵ ﻫﺰﻳﻨﻪ ﺍﺗﺼﺎﻝ‬
‫ﺧﺼﻮﺻﯽ ﻧﻴﺴﺖ ﺑﻠﮑﻪ ﺑﻮﺳﻴﻠﻪ ﺩﻭ ﮔﺮﻩ ﻣﺸﺨﺺ ﻣﯽﺷﻮﺩ‪ .‬ﻋﻼﻭﻩ ﺑﺮ ﺁﻥ ﭘﺮﻭﺗﮑﻞ ﺍﺭﺳﺎﻝ ﺑﻬﻴﻨﻪ‪ ،‬ﺑﺮ ﭘﺎﻳﻪ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﺯﻧﺠﻴﺮﻩ‪-‬‬
‫ﻫﺎﯼ ﺩﺭﻫﻢ ﺳﺎﺯ ﺩﺭ ﺭﻣﺰﻧﮕﺎﺭﯼ ﺑﻪ ﻣﻨﻈﻮﺭ ﺩﺭﻳﺎﻓﺖ ﭘﻮﻝ‪ ،‬ﺍﺭﺍﺋﻪ ﺷﺪﻩ ﺍﺳﺖ‪.‬‬
‫‪iPass9 3.2‬‬
‫ﺩﺭ ]‪ [6‬ﺭﺍﻫﮑﺎﺭﯼ ﺭﺍﺳﺘﮕﻮﻳﺎﻧﻪ‪ ،10‬ﻣﺒﺘﻨﯽ ﺑﺮ ﻣﺰﺍﻳﺪﻩ‪ 11‬ﺑﻪ ﻧﺎﻡ ‪ ،iPass‬ﺑﻪ ﻣﻨﻈﻮﺭ ﺍﻳﺠﺎﺩ ﻫﻤﮑﺎﺭﯼ ﺩﺭ ﻓﺮﺳﺘﺎﺩﻥ ﺑﺴﺘﻪﻫﺎ‬
‫ﭘﻴﺸﻨﻬﺎﺩ ﺷﺪﻩ ﺍﺳﺖ‪ .‬ﺩﺭ ﺍﻳﻦ ﺭﻭﺵ ﻫﺮ ﻣﺴﻴﺮﻳﺎﺏ ﺍﺯ ﻳﮏ ”‪ “Smart market‬ﺗﺸﮑﻴﻞ ﺷﺪﻩ ﺍﺳﺖ ﮐﻪ ﻓﺮﺁﻳﻨﺪ ﻣﺰﺍﻳﺪﻩ ﺭﺍ ﺑﻪ‬
‫ﻃﻮﺭ ﭘﻴﻮﺳﺘﻪ ﺍﺟﺮﺍ ﻣﯽﮐﻨﺪ‪ .‬ﻓﺮﺁﻳﻨﺪ ﻣﺰﺍﻳﺪﻩ ﻣﺸﺨﺺ ﻣﯽﮐﻨﺪ ﮐﻪ ﮐﺪﺍﻡ ﺟﺮﻳﺎﻥ ﺑﺎﻳﺪ ﭼﻪ ﻣﻘﺪﺍﺭ ﺍﺯ ﭘﻬﻨﺎﯼ ﺑﺎﻧﺪ ﻭ ﺑﺎ ﭼﻪ ﻫﺰﻳﻨﻪ‪-‬‬
‫ﺍﯼ ﺩﺭﻳﺎﻓﺖ ﮐﻨﺪ‪ .‬ﺩﺭ ﺍﻳﻦ ﺭﻭﺵ ﭘﻴﺸﻨﻬﺎﺩ ﺩﻫﻨﺪﮔﺎﻥ‪ ،‬ﺟﺮﻳﺎﻥ ﻫﺎﻳﯽ ﻫﺴﺘﻨﺪ ﮐﻪ ﺍﺯ ﻣﺴﻴﺮﻳﺎﺏﻫﺎ ﻋﺒﻮﺭ ﻣﯽﮐﻨﻨﺪ‪ .‬ﻫﺮ ﺟﺮﻳﺎﻥ‬
‫ﭘﻴﺸﻨﻬﺎﺩﯼ ﺭﺍ ﺣﻤﻞ ﻣﯽﮐﻨﺪ‪ ،‬ﮐﻪ ﻧﺸﺎﻥ ﺩﻫﻨﺪﻩﯼ ﻣﻘﺪﺍﺭ ﭘﻮﻝ ﭘﺮﺩﺍﺧﺘﯽ ﺑﺮﺍﯼ ﺳﺮﻭﻳﺲ ﺍﺭﺳﺎﻝ ﺍﺳﺖ‪ .‬ﺑﺮ ﻣﺒﻨﺎﯼ ﭘﻴﺸﻨﻬﺎﺩﻫﺎﯼ‬
‫ﺩﺭﻳﺎﻓﺘﯽ ﻣﺴﻴﺮﻳﺎﺏ "ﻣﺰﺍﻳﺪﻩ ﻋﻤﻮﻣﯽ ‪ 12"Vickrey‬ﺭﺍ ﺍﺟﺮﺍ ﻣﯽﮐﻨﺪ‪.‬‬
‫‪8‬‬
‫‪Dynamic Source Routing‬‬
‫‪an Incentive Compatible Auction Scheme to Enable Packet Forwarding Service in MANET‬‬
‫‪10 Incentive Compatible‬‬
‫‪11 Auction‬‬
‫‪12 Generalized Vickrey Auction‬‬
‫‪9‬‬
‫ﺩﺭ ﺍﻳﻦ ﺭﻭﺵ ﭘﻴﺸﻨﻬﺎﺩ ﺟﺮﻳﺎﻥﻫﺎ ﺑﻮﺳﻴﻠﻪ ﻓﺮﺳﺘﻨﺪﻩ ﺗﻨﻈﻴﻢ ﻣﯽﺷﻮﺩ‪ .‬ﺍﻳﻦ ﭘﻴﺸﻨﻬﺎﺩ ﻧﺸﺎﻥ ﺩﻫﻨﺪﻩﯼ ﺳﻮﺩﻣﻨﺪﯼ ﮐﺎﺭﺑﺮ ﺩﺭ‬
‫ﺑﺪﺳﺖ ﺁﻭﺭﺩﻥ ﻳﮏ ﻭﺍﺣﺪ ﺍﺯ ﭘﻬﻨﺎﯼ ﺑﺎﻧﺪ ﺍﺳﺖ‪ .‬ﺩﺭ ]‪ [6‬ﺳﻮﺩﻣﻨﺪﯼ ﮐﺎﺭﺑﺮ ﺑﻮﺳﻴﻠﻪ ﻭﺍﺣﺪﻫﺎﯼ ﭘﻮﻟﯽ)‪ ($‬ﺍﻧﺪﺍﺯﻩﮔﻴﺮﯼ ﻣﯽﺷﻮﺩ‪.‬‬
‫ﺑﻨﺎﺑﺮﺍﻳﻦ ﮐﺎﺭﺑﺮﺍﻥ ﺧﻮﺍﻫﺎﻥ ﺩﺭﻳﺎﻓﺖ ﻣﻘﺪﺍﺭ ﻣﺸﺨﺼﯽ ﭘﻮﻝ ﺩﺭ ﻭﺍﺣﺪ ﺯﻣﺎﻥ ﺑﻪ ﻣﻨﻈﻮﺭ ﺑﺪﺳﺖ ﺁﻭﺭﺩﻥ ﻣﻘﺪﺍﺭ ﻣﺸﺨﺼﯽ ﺍﺯ ﭘﻬﻨﺎﯼ‬
‫ﺑﺎﻧﺪ ﻫﺴﺘﻨﺪ‪ .‬ﺑﻪ ﻫﻤﻴﻦ ﺟﻬﺖ ﭘﻴﺸﻨﻬﺎﺩ ﮐﺎﺭﺑﺮ ﺑﺮﺍﯼ ﺩﺭﻳﺎﻓﺖ ﭘﻬﻨﺎﯼ ﺑﺎﻧﺪ ﺑﺮ ﺣﺴﺐ )‪ ($/Sec)/(Byte/Sec‬ﺑﻴﺎﻥ ﻣﯽﺷﻮﺩ‪.‬‬
‫ﻋﻼﻭﻩ ﺑﺮ ﭘﻴﺸﻨﻬﺎﺩ ﮐﺎﺭﺑﺮ ﺣﺪﺍﮐﺜﺮ ﭘﻬﻨﺎﯼ ﺑﺎﻧﺪ ﺩﺭﺧﻮﺍﺳﺘﯽ ﺭﺍ ﻧﻴﺰ ﺗﻌﻴﻴﻦ ﻣﯽﺷﻮﺩ‪ r ،b .‬ﺑﻪ ﺗﺮﺗﻴﺐ ﻧﺸﺎﻥ ﺩﻫﻨﺪﻩﯼ ﭘﻴﺸﻨﻬﺎﺩ‬
‫ﮐﺎﺭﺑﺮ ﻭ ﺣﺪﺍﮐﺜﺮ ﭘﻬﻨﺎﯼ ﺑﺎﻧﺪ ﺩﺭﺧﻮﺍﺳﺘﯽ ﻫﺴﺘﻨﺪ‪.‬‬
‫ﻫﻤﺎﻥ ﻃﻮﺭ ﮐﻪ ﮔﻔﺘﻪ ﺷﺪ ﻣﺴﻴﺮﻳﺎﺏ ﺍﺯ " ﻣﺰﺍﻳﺪﻩ ﻋﻤﻮﻣﯽ ‪ " Vickrey‬ﺍﺳﺘﻔﺎﺩﻩ ﻣﯽﮐﻨﺪ‪ .‬ﺍﺑﺘﺪﺍ ﻣﺴﻴﺮﻳﺎﺏ ﭘﻴﺸﻨﻬﺎﺩﻫﺎﯼ‬
‫ﺩﺭﻳﺎﻓﺖ ﺷﺪﻩ ﺭﺍ ﺑﻪ ﺻﻮﺭﺕ ﻧﺰﻭﻟﯽ ﻣﺮﺗﺐ ﻣﯽﮐﻨﺪ)‪ .(b1>b2> . . . >bn‬ﺣﺪﺍﮐﺜﺮ ﭘﻬﻨﺎﯼ ﺑﺎﻧﺪ ﺩﺭ ﺩﺳﺘﺮﺱ ﻣﺴﻴﺮﻳﺎﺏ‬
‫‪ 100%‬ﺍﺳﺖ‪ .‬ﻣﺴﻴﺮﻳﺎﺏ ﺍﺑﺘﺪﺍ ﺑﻪ ﺟﺮﻳﺎﻧﯽ ﮐﻪ ﺑﻴﺸﺘﺮﻳﻦ ﭘﻴﺸﻨﻬﺎﺩ ﺭﺍ ﺩﺍﺷﺘﻪ ﺍﺳﺖ‪ ،‬ﺣﺪﺍﮐﺜﺮ ﭘﻬﻨﺎﯼ ﺑﺎﻧﺪ ﺩﺭﺧﻮﺍﺳﺘﯽﺍﺵ ﺭﺍ‬
‫ﻣﯽﺩﻫﺪ)‪ .(r‬ﺳﭙﺲ ﺑﺎﻗﯽ ﻣﺎﻧﺪﻩ ﭘﻬﻨﺎﯼ ﺑﺎﻧﺪ ﺭﺍ ﺑﻪ ﺩﻭﻣﻴﻦ ﺑﻴﺸﺘﺮﻳﻦ ﭘﻴﺸﻨﻬﺎﺩ ﻣﯽﺩﻫﺪ‪ .‬ﺍﻳﻦ ﻋﻤﻞ ﺑﻪ ﻫﻤﻴﻦ ﺗﺮﺗﻴﺐ ﺍﺩﺍﻣﻪ‬
‫ﻣﯽﻳﺎﺑﺪ ﺗﺎ ﮐﻞ ﭘﻬﻨﺎﯼ ﺑﺎﻧﺪ ﻣﺴﻴﺮﻳﺎﺏ ﺍﺳﺘﻔﺎﺩﻩ ﺷﻮﺩ‪ .‬ﺑﺮﺍﯼ ﻣﺜﺎﻝ‪ :‬ﻓﺮﺽ ﮐﻨﻴﺪ ﮐﻪ ﭼﻬﺎﺭ ﺟﺮﻳﺎﻥ ﻭﺟﻮﺩ ﺩﺍﺭﺩ‪ .‬ﭘﻴﺸﻨﻬﺎﺩﻫﺎ ﻭ‬
‫ﺣﺪﺍﮐﺜﺮ ﭘﻬﻨﺎﯼ ﺑﺎﻧﺪﻫﺎﯼ ﺩﺭﺧﻮﺍﺳﺘﯽ ﺑﺪﻳﻦ ﺻﻮﺭﺕ ﺍﺳﺖ‪.{(10, 50%), (9, 40%), (6, 30%), (5, 80%)}.‬‬
‫ﺩﺭ ﺍﻳﻦ ﺣﺎﻟﺖ ﻣﺴﻴﺮ ﻳﺎﺏ ‪ 50%‬ﺭﺍ ﺑﻪ ﺟﺮﻳﺎﻥ ﺍﻭﻝ‪ 40% ،‬ﺑﻪ ﺟﺮﻳﺎﻥ ﺩﻭﻡ ﻭ ‪ 10%‬ﺑﻪ ﺟﺮﻳﺎﻥ ﺳﻮﻡ ﻣﯽﺩﻫﺪ‪ .‬ﺩﺭ ﺍﻳﻦ‬
‫ﺣﺎﻟﺖ ﺟﺮﻳﺎﻥ ﺳﻮﻡ ﺗﻨﻬﺎ ﺩﺭﺻﺪﯼ ﺍﺯ ﺩﺭﺧﻮﺍﺳﺖ ﺧﻮﺩ ﺭﺍ ﺩﺭﻳﺎﻓﺖ ﻣﯽﮐﻨﺪ‪ .‬ﺑﺮﺍﯼ ‪ 20%‬ﺑﺎﻗﯽ ﻣﺎﻧﺪﻩ ﻧﻴﺰ ﺑﺎﻳﺪ ‪ 6‬ﻭﺍﺣﺪ‬
‫ﭘﺮﺩﺍﺧﺖ ﮐﻨﺪ‪ .‬ﻫﺰﻳﻨﻪ ﺟﺮﻳﺎﻥ ﺍﻭﻝ ﺑﻪ ﺻﻮﺭﺕ )‪ 6*20%+5*30%=2.7($/Sec‬ﻣﺤﺎﺳﺒﻪ ﻣﯽﺷﻮﺩ‪ .‬ﺑﺎ ﺗﻮﺟﻪ ﺑﻪ ﺍﻳﻨﮑﻪ‬
‫ﺟﺮﻳﺎﻥ ﺍﻭﻝ ‪ 50%‬ﺍﺯ ﭘﻬﻨﺎﯼ ﺑﺎﻧﺪ ﺭﺍ ﺩﺭﻳﺎﻓﺖ ﮐﺮﺩﻩ ﺍﺳﺖ‪ .‬ﺍﻳﻦ ﺍﻣﺮ ﻣﻮﺟﺐ ﺍﺯ ﺩﺳﺖ ﺩﺍﺩﻥ ‪ 20%‬ﺍﺯ ﭘﻬﻨﺎﯼ ﺑﺎﻧﺪ ﺑﺮﺍﯼ ﺟﺮﻳﺎﻥ‬
‫ﺳﻮﻡ ﻭ ‪ 30%‬ﺑﺮﺍﯼ ﺟﺮﻳﺎﻥ ﭼﻬﺎﺭﻡ ﻣﯽﺷﻮﺩ‪ .‬ﺑﻨﺎﺑﺮﺍﻳﻦ ﺑﺨﺶ ﺍﻭﻝ ‪ 6*20%‬ﺍﺯ ﻫﺰﻳﻨﻪ ﺟﺮﻳﺎﻥ ﺳﻮﻡ ﻭ ﺑﺨﺶ ﺩﻭﻡ ‪5*30%‬‬
‫ﺍﺯ ﻫﺰﻳﻨﻪ ﺟﺮﻳﺎﻥ ﭼﻬﺎﺭﻡ ﻣﯽﺁﻳﺪ‪.‬‬
‫ﻫﻤﭽﻨﻴﻦ ﺩﺭ ﺍﻳﻦ ﺭﻭﺵ ﺑﺮﺍﯼ ﻣﺴﻴﺮﻳﺎﺏ ﺍﻳﻦ ﺍﻣﮑﺎﻥ ﻭﺟﻮﺩ ﺩﺍﺭﺩ ﮐﻪ ﻣﺒﻠﻎ ﺭﺯﺭﻭ ﺭﺍ ﻣﺸﺨﺺ ﮐﻨﺪ‪ .‬ﻣﺒﻠﻎ ﺭﺯﺭﻭ ﻧﺸﺎﻥ‬
‫ﺩﻫﻨﺪﻩﯼ ﻋﻤﻠﻴﺎﺕ ﻣﺴﻴﺮﻳﺎﺏ ﺑﺮﺍﯼ ﺳﺮﻭﻳﺲ ﺍﺭﺳﺎﻝ ﺍﺳﺖ‪ .‬ﺩﺭ ﺍﻳﻦ ﺣﺎﻟﺖ ﺍﮔﺮ ﻣﺴﻴﺮﻳﺎﺏ ﭘﻬﻨﺎﯼ ﺑﺎﻧﺪﯼ ﺑﺮﺍﯼ ﺗﺨﺼﻴﺺ ﺩﺍﺷﺘﻪ‬
‫ﺑﺎﺷﺪ‪ .‬ﺍﻣﺎ ﻣﻘﺪﺍﺭ ﭘﻴﺸﻨﻬﺎﺩﯼ ﺟﺮﻳﺎﻥﻫﺎ ﮐﻤﺘﺮ ﺍﺯ ﻣﺒﻠﻎ ﺭﺯﺭﻭ ﺑﺎﺷﺪ‪ ،‬ﻣﺴﻴﺮﻳﺎﺏ ﺍﺯ ﺍﺧﺘﺼﺎﺹ ﭘﻬﻨﺎﯼ ﺑﺎﻧﺪ ﺻﺮﻑ ﻧﻈﺮ ﻣﯽﮐﻨﺪ‪.‬‬
‫ﺑﻨﺎﺑﺮﺍﻳﻦ ﻣﻤﮑﻦ ﺍﺳﺖ ﺩﺭﺻﺪﯼ ﺍﺯ ﭘﻬﻨﺎﯼ ﺑﺎﻧﺪ ﻣﺴﻴﺮﻳﺎﺏ ﺍﺳﺘﻔﺎﺩﻩ ﻧﺸﻮﺩ‪.‬‬
‫ﺩﺭ ]‪ [6‬ﺍﺛﺒﺎﺕ ﺷﺪﻩ ﺍﺳﺖ ﮐﻪ ‪ iPass‬ﺭﺍﺳﺖﮔﻮﻳﺎﻧﻪ ﺍﺳﺖ ﻭ ﺗﻤﺎﻡ ﺟﺮﻳﺎﻥﻫﺎ ﺍﺭﺯﺵ ﻭﺍﻗﻌﯽ ﺧﻮﺩ ﺭﺍ ﭘﻴﺸﻨﻬﺎﺩ ﻣﯽﺩﻫﻨﺪ‪ ،‬ﺳﻮﺩ‬
‫ﻣﺴﻴﺮﻳﺎﺏﻫﺎ ﻭ ﺟﺮﻳﺎﻥﻫﺎ ﻏﻴﺮﻣﻨﻔﯽ ﺍﺳﺖ‪ .‬ﻋﻼﻭﻩ ﺑﺮ ﺍﻳﻦ ﺍﺭﺳﺎﻝ ﺑﺴﺘﻪﻫﺎ ﻣﻨﺠﺮ ﺑﻪ ﺑﻴﺸﺘﺮ ﺷﺪﻥ ﺳﻮﺩ ﻋﻤﻮﻣﯽ‪ 13‬ﮐﻞ ﺷﺒﮑﻪ‬
‫ﻣﯽﺷﻮﺩ‪ .‬ﻣﺸﮑﻞ ﺍﻳﻦ ﺭﻭﺵ ﻋﺪﻡ ﺩﺭ ﻧﻈﺮ ﮔﺮﻓﺘﻦ ﺍﻣﻨﻴﺖ ﭘﺮﺩﺍﺧﺖ ﻭ ﺍﻣﻨﻴﺖ ﺳﻴﺴﺘﻢ ﺣﺴﺎﺑﺪﺍﺭﯼ ﺑﻪ ﻣﻨﻈﻮﺭ ﺗﺒﺎﺩﻝ ﺍﻣﻦ‬
‫ﺳﺮﻣﺎﻳﻪﻫﺎﺳﺖ‪.‬‬
‫‪ 4.2‬ﻣﺴﻴﺮﻳﺎﺑﯽ ﻣﺒﺘﻨﯽ ﺑﺮ ﻗﻴﻤﺖﮔﺬﺍﺭﯼ ﭘﻮﻳﺎ‬
‫ﺩﺭ ﺷﺒﮑﻪﻫﺎﯼ ﻣﻮﺭﺩﯼ ﺳ ّﻴﺎﺭ ﻣﻌﻤﻮ ًﻻ ﭼﻨﺪ ﻣﺴﻴﺮ ﺑﻴﻦ ﻣﺒﺪﺍ ﻭ ﻣﻘﺼﺪ ﻭﺟﻮﺩ ﺩﺍﺭﺩ‪ .‬ﻋﻼﻭﻩ ﺑﺮ ﺁﻥ ﺑﺪﻟﻴﻞ ﺣﺮﮐﺖ ﮔﺮﻩﻫﺎ‬
‫ﻣﺴﻴﺮﻫﺎﯼ ﻣﻮﺟﻮﺩ ﺑﻴﻦ ﺩﻭ ﮔﺮﻩ ﻣﺮﺗﺒ ًﺎ ﺗﻐﻴﻴﺮ ﻣﯽﮐﻨﺪ‪ .‬ﺩﺭ ]‪ [2‬ﮔﻮﻧﺎﮔﻮﻧﯽ ﻣﺴﻴﺮ ﻭ ﺗﻔﺎﻭﺕ ﺯﻣﺎﻧﯽ ﺩﺭ ﻣﺴﻴﺮﻳﺎﺑﯽ ﺩﺭ ﻧﻈﺮ ﮔﺮﻓﺘﻪ‬
‫ﺷﺪﻩﺍﺳﺖ‪ .‬ﻣﻨﻈﻮﺭ ﺍﺯ ﮔﻮﻧﺎﮔﻮﻧﯽ ﻣﺴﻴﺮ‪ ،‬ﻭﺟﻮﺩ ﻣﺴﻴﺮﻫﺎﻳﯽ ﺑﺎ ﺧﺼﻮﺻﻴﺎﺕ ﻣﺨﺘﻠﻔﯽ ﻣﺎﻧﻨﺪ ﺗﻌﺪﺍﺩ ﮔﺎﻡﻫﺎ‪ ،‬ﻫﺰﻳﻨﻪ ﻭ ﻣﺪﺕ ﺯﻣﺎﻥ‬
‫ﻣﻌﺘﺒﺮ ﺑﻮﺩﻥ ﻣﺴﻴﺮ ﺍﺳﺖ‪ .‬ﺗﻔﺎﻭﺕ ﺯﻣﺎﻧﯽ ﻧﻴﺰ ﺑﻪ ﻣﻌﻨﯽ ﺗﻐﻴﻴﺮ ﻣﺴﻴﺮ ﺑﻴﻦ ﺩﻭ ﮔﺮﻩ ﺩﺭ ﻃﻮﻝ ﺯﻣﺎﻥ ﺑﺪﻟﻴﻞ ﺣﺮﮐﺖ ﻭ ﭘﻮﻳﺎﻳﯽ‬
‫ﺍﻟﮕﻮﯼ ﺗﺮﺍﻓﻴﮑﯽ ﺍﺳﺖ ‪.‬‬
‫‪Social Welfare‬‬
‫‪13‬‬
‫ﺩﺭ ﺭﻭﺵ ﺍﺭﺍﺋﻪ ﺷﺪﻩ ﮔﺮﻩ ﻣﺒﺪﺍ ﺭﻗﺎﺑﺖ ﺑﻴﻦ ﻣﺴﻴﺮﻫﺎﯼ ﻣﺨﺘﻠﻒ ﺭﺍ ﺍﺯ ﻃﺮﻳﻖ ﺑﺮﮔﺰﺍﺭﯼ ﻣﺰﺍﻳﺪﻩ ﺍﻳﺠﺎﺩ ﻣﯽﮐﻨﺪ‪ .‬ﻋﻼﻭﻩ ﺑﺮ ﺁﻥ‬
‫ﻫﺮ ﮔﺮﻩ ﻣﯽﺗﻮﺍﻧﺪ ﺗﻔﺎﻭﺕ ﺯﻣﺎﻧﯽ ﺭﺍ ﺑﺮﺍﯼ ﺑﻴﺸﻴﻨﻪ ﮐﺮﺩﻥ ﺳﻮﺩ ﺧﻮﺩ ﺩﺭ ﻃﻮﻝ ﺯﻣﺎﻥ ﺗﻌﺮﻳﻒ ﮐﻨﺪ‪ .‬ﺑﺮﺍﯼ ﺗﻌﺮﻳﻒ ﺗﻔﺎﻭﺕ ﺯﻣﺎﻧﯽ‬
‫ﮔﺮﻩ ﻣﺒﺪﺍ ﺗﻌﺪﺍﺩ ﺑﺴﺘﻪﻫﺎﯼ ﺍﺭﺳﺎﻟﯽ ﺭﺍ ﻣﻄﺎﺑﻖ ﺑﺎ ﺷﺮﺍﻳﻂ ﺷﺒﮑﻪ ﺍﻧﺘﺨﺎﺏ ﻣﯽﮐﻨﺪ‪ .‬ﺍﮔﺮ ﺷﺮﺍﻳﻂ ﺷﺒﮑﻪ ﺧﻮﺏ ﺑﺎﺷﺪ‪ ،‬ﺑﺴﺘﻪﻫﺎﯼ‬
‫ﺑﻴﺸﺘﺮﯼ ﺭﺍ ﺩﺭ ﻣﺮﺣﻠﻪ ﺟﺎﺭﯼ ﺍﺭﺳﺎﻝ ﻣﯽﮐﻨﺪ‪ .‬ﺩﺭ ﺣﺎﻟﺘﯽ ﮐﻪ ﺷﺮﺍﻳﻂ ﺷﺒﮑﻪ ﺧﻮﺏ ﻧﻴﺴﺖ‪ ،‬ﺑﺴﺘﻪﻫﺎﯼ ﮐﻤﺘﺮﯼ ﺭﺍ ﺍﺭﺳﺎﻝ ﻣﯽ‪-‬‬
‫ﮐﻨﺪ‪.‬‬
‫ﺩﺭ ]‪ [2‬ﺍﺑﺘﺪﺍ ﻣﺴﻴﺮﻳﺎﺑﯽ ﻣﺒﺘﻨﯽ ﺑﺮ ﻗﻴﻤﺖ ﮔﺬﺍﺭﯼ ﺑﻮﺳﻴﻠﻪ ﺑﺎﺯﯼ ﻗﻴﻤﺖ ﮔﺬﺍﺭﯼ ﭘﻮﻳﺎ ﻣﺪﻝ ﻣﯽﺷﻮﺩ‪ .‬ﺑﺎ ﻣﺪﻝ ﮐﺮﺩﻥ‬
‫ﻣﺴﻴﺮﻳﺎﺑﯽ ﻣﺒﺘﻨﯽ ﺑﺮ ﻗﻴﻤﺖ ﮔﺬﺍﺭﯼ ﻓﺮﺳﺘﻨﺪﻩ ﻣﯽﺗﻮﺍﻧﺪ ﺗﻔﺎﻭﺕ ﺯﻣﺎﻧﯽ ﺭﺍ ﺑﺮﺍﯼ ﺍﻓﺰﺍﻳﺶ ﺳﻮﺩ ﺧﻮﺩ ﺑﻪ ﻃﻮﺭ ﺗﻄﺒﻴﻘﯽ ﺑﻪ ﺑﺴﺘﻪ‪-‬‬
‫ﻫﺎﻳﯽ ﮐﻪ ﺩﺭ ﻣﺮﺍﺣﻞ ﻣﺨﺘﻠﻒ ﺍﺭﺳﺎﻝ ﻣﯽﮐﻨﺪ‪ ،‬ﺍﺧﺘﺼﺎﺹ ﺩﻫﺪ‪ .‬ﻣﻌﻴﺎﺭ ﺍﺧﺘﺼﺎﺹ ﺩﺍﺩﻥ ﺑﺪﻳﻦ ﺻﻮﺭﺕ ﺍﺳﺖ ﮐﻪ ﺩﺭ ﻣﺮﺍﺣﻠﻪﺍﯼ‬
‫ﮐﻪ ﻫﺰﻳﻨﻪﯼ ﺍﺭﺳﺎﻝ ﺑﺴﺘﻪ ﮐﻤﺘﺮﺍﺳﺖ‪ ،‬ﻓﺮﺳﺘﻨﺪﻩ ﺑﺴﺘﻪﻫﺎﯼ ﺑﻴﺸﺘﺮﯼ ﺭﺍ ﺍﺭﺳﺎﻝ ﻣﯽﮐﻨﺪ‪ .‬ﺳﭙﺲ ﺍﺯ ﺑﺮﻧﺎﻣﻪ ﻧﻮﻳﺴﯽ ﭘﻮﻳﺎ ﺑﺮﺍﯼ‬
‫ﭘﻴﺎﺩﻩ ﺳﺎﺯﯼ ﻗﻴﻤﺖ ﮔﺬﺍﺭﯼ ﭼﻨﺪ ﻣﺮﺣﻠﻪﺍﯼ ﺩﺭ ﺷﺒﮑﻪﻫﺎﯼ ﻣﻮﺭﺩﯼ ﺳ ّﻴﺎﺭ ﺍﺳﺘﻔﺎﺩﻩ ﻣﯽﺷﻮﺩ‪ .‬ﺩﺭ ﻧﻬﺎﻳﺖ ﮔﻮﻧﺎﮔﻮﻧﯽ ﻣﺴﻴﺮ ﺑﺎ ﺑﻪ‬
‫ﮐﺎﺭ ﺑﺮﺩﻥ ﻣﮑﺎﻧﻴﺰﻳﻢ ﻣﺰﺍﻳﺪﻩ ﺩﺭ ﻫﺮ ﻣﺮﺣﻠﻪ ﺍﻧﺠﺎﻡ ﻣﯽﭘﺬﻳﺮﺩ‪.‬‬
‫ﻣﮑﺎﻧﻴﺰﻳﻢ ﺍﺭﺍﺋﻪ ﺷﺪﻩ ﺩﺭ ]‪ [1‬ﻣﺸﺎﺑﻪ ]‪ [2‬ﺍﺳﺖ‪ .‬ﺑﺎ ﺍﻳﻦ ﺗﻔﺎﻭﺕ ﮐﻪ ﺩﺭ ]‪ [1‬ﭼﮕﻮﻧﮕﯽ ﺍﺟﺮﺍﯼ ﻣﺴﻴﺮﻳﺎﺑﯽ ﺧﻮﺩﻣﺨﺘﺎﺭ ﺩﺭ‬
‫ﺳﻨﺎﺭﻳﻮﻫﺎﯼ ﭘﻮﻳﺎﯼ ﺷﺒﮑﻪ ﻣﻮﺭﺩﯼ ﺳ ّﻴﺎﺭ ﺑﻮﺳﻴﻠﻪ ﮔﺮﻩﻫﺎﯼ ﺧﻮﺩﺧﻮﺍﻩ ﺑﻪ ﺟﺎﯼ ﺍﺭﺳﺎﻝ ﺑﺴﺘﻪ ﺑﻴﻦ ﮔﺮﻩﻫﺎﯼ ﺧﻮﺩﺧﻮﺍﻩ ﺑﺮﺭﺳﯽ‬
‫ﺷﺪﻩﺍﺳﺖ‪.‬‬
‫‪ 3‬ﻧﺘﻴﺠﻪ ﮔﻴﺮﯼ‬
‫ﺩﺭ ﺍﻳﻦ ﮔﺰﺍﺭﺵ ﭼﻨﺪ ﺭﻭﺵ ﻣﺴﻴﺮﻳﺎﺑﯽ ﻣﺒﺘﻨﯽ ﺑﺮ ﻗﻴﻤﺖ ﮔﺬﺍﺭﯼ ﻣﻌﺮﻓﯽ ﺷﺪ‪ .‬ﺩﺭ ﺭﻭﺵﻫﺎﯼ ‪ Ad hoc-VCG ،Sprite‬ﻭ‬
‫‪ iPass‬ﺗﻮﭘﻮﻟﻮﮊﯼ ﺷﺒﮑﻪ ﺛﺎﺑﺖ ﺩﺭ ﻧﻈﺮ ﮔﺮﻓﺘﻪ ﺷﺪﻩﺍﺳﺖ‪ .‬ﺣﺎﻝ ﺁﻧﮑﻪ ﺗﻮﭘﻮﻟﻮﮊﯼ ﺷﺒﮑﻪ ﺑﺪﻟﻴﻞ ﺣﺮﮐﺖ ﮔﺮﻩﻫﺎ ﻭ ﭘﻮﻳﺎﻳﯽ‬
‫ﺍﻟﮕﻮﯼ ﺗﺮﺍﻓﻴﮑﯽ ﻣﺮﺗﺒ ًﺎ ﺩﺭ ﺣﺎﻝ ﺗﻐﻴﻴﺮ ﺍﺳﺖ‪ .‬ﺑﻪ ﻫﻤﻴﻦ ﺟﻬﺖ ﺭﻭﺵﻫﺎﯼ ﻣﺒﺘﻨﯽ ﺑﺮ ﻗﻴﻤﺖ ﮔﺬﺍﺭﯼ ﭘﻮﻳﺎ ﺍﺭﺍﺋﻪ ﺷﺪﻧﺪ‪ .‬ﻭﻳﮋﮔﯽ‬
‫ﺷﺎﺧﺺ ﺍﻳﻦ ﺭﻭﺵﻫﺎ ﺩﺭ ﻧﻈﺮ ﮔﺮﻓﺘﻦ ﭘﻮﻳﺎﻳﯽ ﻣﺴﻴﺮ ﺩﺭ ﺭﺍﻫﮑﺎﺭ ﭘﻴﺸﻨﻬﺎﺩﯼ ﺍﺳﺖ‪ .‬ﺩﺭ ﻣﻴﺎﻥ ﺭﻭﺵﻫﺎﯼ ﻣﺒﺘﻨﯽ ﺑﺮ ﻗﻴﻤﺖ‬
‫ﮔﺬﺍﺭﯼ ﭘﻮﻳﺎ‪ ،‬ﺭﻭﺵ ﺍﺭﺍﺋﻪ ﺷﺪﻩ ﺩﺭ ]‪ [2‬ﻣﺸﺎﺑﻪ ﺳﺎﻳﺮ ﺭﻭﺵﻫﺎﯼ ﺍﺭﺍﺋﻪ ﺷﺪﻩ‪ ،‬ﻫﻤﮑﺎﺭﯼ ﺑﻴﻦ ﮔﺮﻩﻫﺎﯼ ﺧﻮﺩﺧﻮﺍﻩ ﺑﺮﺍﯼ ﺍﺭﺳﺎﻝ‬
‫ﺑﺴﺘﻪ ﺷﺒﻴﻪ ﺳﺎﺯﯼ ﮐﺮﺩﻩ ﺍﺳﺖ‪ .‬ﺑﺪﻳﻦ ﺻﻮﺭﺕ ﮐﻪ ﮔﺮﻩﻫﺎﯼ ﺧﻮﺩﺧﻮﺍﻩ ﺍﮔﺮ ﺑﺘﻮﺍﻧﻨﺪ ﭘﻮﻟﯽ ﺭﺍ ﺑﻪ ﺟﻬﺖ ﺍﺭﺳﺎﻝ ﺑﺴﺘﻪ ﻫﺎﯼ ﺳﺎﻳﺮ‬
‫ﮔﺮﻩﻫﺎ ﺩﺭﻳﺎﻓﺖ ﮐﻨﻨﺪ‪ ،‬ﺑﺴﺘﻪ ﺭﺍ ﺍﺭﺳﺎﻝ ﻣﯽ ﮐﻨﻨﺪ‪ .‬ﺍﻣﺎ ﺩﺭ ]‪ [1‬ﻫﻤﮑﺎﺭﯼ ﮔﺮﻩﻫﺎ ﺩﺭ ﺷﺮﺍﻳﻂ ﭘﻴﭽﻴﺪﻩﺗﺮﯼ ﻃﺮﺍﺣﯽ ﺷﺪﻩﺍﺳﺖ‪.‬‬
‫ﺩﺭ ﺍﻳﻦ ﺣﺎﻟﺖ ﭼﮕﻮﻧﮕﯽ ﺍﺟﺮﺍﯼ ﻣﺴﻴﺮﻳﺎﺑﯽ ﺧﻮﺩﻣﺨﺘﺎﺭ ﺩﺭ ﺳﻨﺎﺭﻳﻮﻫﺎﯼ ﭘﻮﻳﺎﯼ ﺷﺒﮑﻪ ﻣﻮﺭﺩﯼ ﺳﻴﺎﺭ ﺑﻮﺳﻴﻠﻪ ﮔﺮﻩﻫﺎﯼ‬
‫ﺧﻮﺩﺧﻮﺍﻩ ﺑﺮﺭﺳﯽ ﺷﺪﻩﺍﺳﺖ‪ .‬ﺩﺭ ﻣﻴﺎﻥ ﺭﻭﺵ ﻫﺎﯼ ﺑﻴﺎﻥ ﺷﺪﻩ‪ ،‬ﺩﺭ ‪ Ad hoc-VCG‬ﻣﺰﺍﻳﺪﻩ ﺑﻮﺳﻴﻠﻪ ﻓﺮﺳﺘﻨﺪﻩ ﺑﺮﮔﺰﺍﺭ ﻣﯽ‬
‫ﺷﻮﺩ‪ .‬ﺩﺭ ﺣﺎﻟﯽ ﮐﻪ ﺩﺭ ﺭﻭﺵ ‪ iPass‬ﻣﺰﺍﻳﺪﻩ ﺩﺭ ﻫﺮ ﻣﺴﻴﺮﻳﺎﺏ ﻭ ﺑﺮﺍﯼ ﺟﺮﻳﺎﻥﻫﺎﯼ ﻋﺒﻮﺭﯼ ﺍﺯ ﺁﻥ ﺍﻧﺠﺎﻡ ﻣﯽﺷﻮﺩ‪ .‬ﻣﺸﮑﻞ‬
‫ﺍﺻﻠﯽ ﺗﻤﺎﻡ ﺭﻭﺵ ﻫﺎﯼ ﮔﻔﺘﻪ ﺷﺪﻩ ﻣﮑﺎﻧﻴﺰﻳﻢ ﻫﺎﯼ ﺍﻣﻨﻴﺘﯽ ﻭ ﭼﮕﻮﻧﮕﯽ ﺗﺒﺎﺩﻝ ﭘﻮﻝ ﺍﺳﺖ‪ .‬ﺑﺎ ﺗﻮﺟﻪ ﺑﻪ ﻣﻄﺎﻟﺐ ﮔﻔﺘﻪ ﺷﺪﻩ‬
‫ﻣﯽﺗﻮﺍﻥ ﺍﺩﻋﺎ ﮐﺮﺩ ﮐﻪ ﺭﻭﺵ ﺍﺭﺍﺋﻪ ﺷﺪﻩ ﺩﺭ ]‪ [1‬ﮐﺎﻣﻠﺘﺮﻳﻦ ﺭﻭﺵ ﺍﺯ ﻣﻴﺎﻥ ﺭﻭﺵﻫﺎﯼ ﻣﻮﺟﻮﺩ ﺍﺳﺖ‪.‬‬
‫ﻣﺮﺍﺟﻊ‬
‫‪[1] 1. Z. Ji, W. Yu, and K. J. R. Liu, “A Game Theoretical Framework for Dynamic Pricing‬‬‫‪Based Routing in Self-Organized MANETs,‘’ IEEE J. Select. Areas Communications,‬‬
‫‪vol. 26,pp. 1204-1217, Sep. 2008.‬‬
[2] Z. Ji, W. Yu, and K. J. R. Liu, “An optimal dynamic pricing framework for autonomous
mobile ad hoc networks,” in Proc. IEEE INFOCOM’06, Barcelona, 2006.
[3] L. Anderegg and S. Eidenbenz, “Ad hoc-VCG: A truthful and cost efficient routing
protocol for mobile ad hoc networks with selfish agents,” in ACM MobiCom’03, 2003,
pp. 245–259.
[4] S. Zhong, L. Liy, Y. G. Liu, Y. R. Yang, “On designing incentive-compatible routing
and forwarding protocols in wireless ad-hoc networks: an integrated approach using
game theoretical and cryptographic techniques,” in Proc. 11th Annu. Int. Conf. Mobile
Computing and Networking, Cologne, Germany, 2005, pp. 117-131.
[5] S. Zhong, L. Li, Y. Liu, and Y. R. Yang, “On designing incentive compatible routing
and forwarding protocols in wireless ad-hoc networks - an integrated approach using
game theoretical and cryptographic techniques,” ACM MobiCom’05, 2005.
[6] K. Chen and K. Nahrstedt, “iPass: an incentive compatible auction scheme to enable
packet forwarding service in MANET,” in ICDCS’04, 2004.
[7] S. Zhong, J. Chen, R Yang, “Sprite: a simple, cheat-proof, creditbased system for mobile
ad-hoc networks,” In Proceedings of IEEE INFOCOM2003, April 2003.